2011
DOI: 10.1016/j.robot.2011.03.006
|View full text |Cite
|
Sign up to set email alerts
|

Conflict free coordinated path planning for multiple robots using a dynamic path modification sequence

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
22
0

Year Published

2012
2012
2022
2022

Publication Types

Select...
6
2
1

Relationship

0
9

Authors

Journals

citations
Cited by 44 publications
(22 citation statements)
references
References 21 publications
0
22
0
Order By: Relevance
“…In [21], trajectories of cooperating robots are represented as the n th order polynomials whose parameters are optimized with genetic algorithms under the robot's dynamic constraints. A two phase approach which uses an incremental A* algorithm to search the configuration space-time for the path planning of multiple robots is shown in [22]. Collision avoidance for redundant manipulators has also been a special subject of different papers [23][24][25].…”
Section: Separation Distancementioning
confidence: 99%
“…In [21], trajectories of cooperating robots are represented as the n th order polynomials whose parameters are optimized with genetic algorithms under the robot's dynamic constraints. A two phase approach which uses an incremental A* algorithm to search the configuration space-time for the path planning of multiple robots is shown in [22]. Collision avoidance for redundant manipulators has also been a special subject of different papers [23][24][25].…”
Section: Separation Distancementioning
confidence: 99%
“…Lee et al [10] proposed an event-based approach for on-line and off-line collision-free trajectory planning for dual-arm assembly systems based on a fast geometric collision detection algorithm. More recently, Chiddarwar and Babu [4] introduced a method that solves the robot conflicts based on a path modification approach. The conflictive paths are modified based on the robot positions in a dynamically computed path modification sequence.…”
Section: Related Workmentioning
confidence: 99%
“…Path coordination planner [1,2,18] decomposes the planning problem into path planning and velocity planning. In the first step, the path planning generates individual robot paths independently, using any common single robot path planners.…”
Section: Previous Workmentioning
confidence: 99%