2004 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS) (IEEE Cat. No.04CH37566)
DOI: 10.1109/iros.2004.1389555
|View full text |Cite
|
Sign up to set email alerts
|

Environment manipulation planner for humanoid robots using task graph that generates action sequence

Abstract: Abstract-In this paper, we describe a planner for a humanoid robot that is capable of finding a path in an environment with movable objects, whereas previous motion planner only deal with an environment with fixed objects. We address an environment manipulation problem for a humanoid robot that finds a walking path from the given start location to the goal location while displacing obstructing objects on the walking path. This problem requires more complex configuration space than previous researches using a m… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
39
0

Publication Types

Select...
6
1
1

Relationship

0
8

Authors

Journals

citations
Cited by 40 publications
(39 citation statements)
references
References 14 publications
(10 reference statements)
0
39
0
Order By: Relevance
“…An example of a work considering a fully known environment can be found in [26], where the problem is solved as follows. The initial configuration, the goal configuration and the configurations describing the position of the obstacles are considered as nodes of a graph, a collision free path is searched between every pair of these configurations and when it is found the corresponding nodes are connected in the graph, and finally, the task solution path is found searching the graph for a branch from the initial to the final configuration; every intermediate node in this branch represents an obstacle that must be removed to execute the task.…”
Section: Related Workmentioning
confidence: 99%
“…An example of a work considering a fully known environment can be found in [26], where the problem is solved as follows. The initial configuration, the goal configuration and the configurations describing the position of the obstacles are considered as nodes of a graph, a collision free path is searched between every pair of these configurations and when it is found the corresponding nodes are connected in the graph, and finally, the task solution path is found searching the graph for a branch from the initial to the final configuration; every intermediate node in this branch represents an obstacle that must be removed to execute the task.…”
Section: Related Workmentioning
confidence: 99%
“…Much of this work assumes only rigid grasping [1,14,17,18,19] or that each object moves only once [14,17,18,19]. van den Berg et al [1] relax this second assumption, but their approach relies on describing connected components of a robot's configuration space, which is intractable for high-dimensional configuration spaces.…”
Section: Related Workmentioning
confidence: 99%
“…In humanoid robot manipulation tasks, grasp planners are seldom used online. Instead often fixed manipulation points on the objects [83], [100] are defined to be able to move objects around and avoid grasp planning. Further, predefined grasps [52] or simple rules for grasp generation are used [9].…”
Section: Grasp Planningmentioning
confidence: 99%