Gross motion planning—a survey
YK Hwang, N Ahuja - ACM Computing Surveys (CSUR), 1992 - dl.acm.org
Motion planning is one of the most important areas of robotics research. The complexity of
the motion-planning problem has hindered the development of practical algorithms. This …
the motion-planning problem has hindered the development of practical algorithms. This …
Guidelines in nonholonomic motion planning for mobile robots
Mobile robots did not wait to know that they were nonholonomic to plan and execute their
motions autonomously. It is interesting to notice that the first navigation systems have been …
motions autonomously. It is interesting to notice that the first navigation systems have been …
[图书][B] Computational geometry: algorithms and applications
M De Berg - 2000 - books.google.com
This well-accepted introduction to computational geometry is a textbook for high-level
undergraduate and low-level graduate courses. The focus is on algorithms and hence the …
undergraduate and low-level graduate courses. The focus is on algorithms and hence the …
[图书][B] Planning algorithms
SM LaValle - 2006 - books.google.com
Planning algorithms are impacting technical disciplines and industries around the world,
including robotics, computer-aided design, manufacturing, computer graphics, aerospace …
including robotics, computer-aided design, manufacturing, computer graphics, aerospace …
[PDF][PDF] A potential field approach to path planning.
YK Hwang, N Ahuja - IEEE transactions on robotics …, 1992 - migrate2wp.web.illinois.edu
We present a path-planning algorithm for the clas-sical mover's problem in three dimensions
using a potential field representation of obstacles. A potential function similar to the …
using a potential field representation of obstacles. A potential function similar to the …
A motion planner for nonholonomic mobile robots
JP Laumond, PE Jacobs, M Taix… - IEEE Transactions on …, 1994 - ieeexplore.ieee.org
This paper considers the problem of motion planning for a car-like robot (ie, a mobile robot
with a nonholonomic constraint whose turning radius is lower-bounded). We present a fast …
with a nonholonomic constraint whose turning radius is lower-bounded). We present a fast …
Roadmap-based path planning-using the voronoi diagram for a clearance-based shortest path
P Bhattacharya, ML Gavrilova - IEEE Robotics & Automation …, 2008 - ieeexplore.ieee.org
Path planning still remains one of the core problems in modern robotic applications, such as
the design of autonomous vehicles and perceptive systems. The basic path-planning …
the design of autonomous vehicles and perceptive systems. The basic path-planning …
[图书][B] Computer science handbook
AB Tucker - 2004 - taylorfrancis.com
When you think about how far and fast computer science has progressed in recent years, it's
not hard to conclude that a seven-year old handbook may fall a little short of the kind of …
not hard to conclude that a seven-year old handbook may fall a little short of the kind of …
Visibility-based pursuit-evasion with limited field of view
We study the visibility-based pursuit-evasion problem, in which one or more searchers must
move through a given environment so as to guarantee detection of any and all evaders …
move through a given environment so as to guarantee detection of any and all evaders …
An energy-efficient path planning algorithm for unmanned surface vehicles
The sea current state affects the energy consumption of Unmanned Surface Vehicles (USVs)
significantly and the path planning approach plays an important role in determining how …
significantly and the path planning approach plays an important role in determining how …