2006
DOI: 10.1007/s10846-006-9067-z
|View full text |Cite
|
Sign up to set email alerts
|

A Dynamic Load-Balancing Parallel Search for Enumerative Robot Path Planning

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1

Citation Types

0
3
0

Year Published

2007
2007
2014
2014

Publication Types

Select...
3
2

Relationship

1
4

Authors

Journals

citations
Cited by 5 publications
(3 citation statements)
references
References 16 publications
0
3
0
Order By: Relevance
“…Parallelism of computation involves distributing the planning computation on different processors in order to increase the overall computational speed of the system [33, 34]. In these works, as distinct from our own, the computing nodes have global knowledge of the environment, and the issue is how to optimize the division of computation.…”
Section: Related Workmentioning
confidence: 99%
“…Parallelism of computation involves distributing the planning computation on different processors in order to increase the overall computational speed of the system [33, 34]. In these works, as distinct from our own, the computing nodes have global knowledge of the environment, and the issue is how to optimize the division of computation.…”
Section: Related Workmentioning
confidence: 99%
“…This paper is motivated by the goal of addressing a new powerful mathematic algorithm for global path planning of UAVs and is called Mesh Adaptive Direct Search (MADS). The path planning problem is to generate a space path between the initial location and the final destination in known or unknown environments, with optimal or near-optimal performance under specific constraint conditions (Taati et al, 2006). One idea for path planning is to introduce a series of waypoint through which a vehicle can go over the terrain to the specified point (Wang et al, 2008).…”
Section: Introductionmentioning
confidence: 99%
“…It is worth pointing out that there is another thread of research studying distributed motion planning from the perspective of parallelism [15], [16], [17], [18], which focuses on distributing computation into different processors. All these works, however, assume processors have access to either a shared or a private copy of a global C-space representation, and therefore address a different problem.…”
Section: Introductionmentioning
confidence: 99%