Proceedings. 1986 IEEE International Conference on Robotics and Automation 1986
DOI: 10.1109/robot.1986.1087461
|View full text |Cite
|
Sign up to set email alerts
|

Minimum time path planning for a robot

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
8
0

Year Published

1989
1989
2015
2015

Publication Types

Select...
4
4
1

Relationship

0
9

Authors

Journals

citations
Cited by 17 publications
(8 citation statements)
references
References 34 publications
0
8
0
Order By: Relevance
“…A minimum time planning approach for a robot was given by Meystel et al [MEY86]. In this method, the robot's acceleration, deceleration and turning capabilities were taken into consideration during planning in order to minimize the overall time-to-goal for the calculated trajectory.…”
Section: Search and Heuristic Methodsmentioning
confidence: 99%
“…A minimum time planning approach for a robot was given by Meystel et al [MEY86]. In this method, the robot's acceleration, deceleration and turning capabilities were taken into consideration during planning in order to minimize the overall time-to-goal for the calculated trajectory.…”
Section: Search and Heuristic Methodsmentioning
confidence: 99%
“…A technique often referred to as obstacle growing [20] extends the obstacles by the dimensions of the robot. This alleviates the problem of collision detection in the path-planning problem since the robot can now be treated as a mass point.…”
Section: Dynamic Obstacle Extensionmentioning
confidence: 99%
“…When positioning is done in the obstacle-cluttered environment, the method of slalom situations can be applied and all the past alternatives can be found as topological passageways, and the final solution is determined by using dynamic programming or searching in the state-space [460]. For the multilink manipulator this approach is explored in [461] If minimum time is required while tracking the specified trajectory similar methods can be applied.…”
Section: Task Decompositionmentioning
confidence: 99%