Path planning using Laplace's equation

Path planning using Laplace's equation

A method for planning smooth robot paths is presented. The method relies on the use of Laplace's equation to constrain the generation of a potential function over regions of the configuration space of an effector. Once the function is computed, paths may be found very quickly. These functions d...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Hauptverfasser: Connolly, C.I., Burns, J.B., Weiss, R.
Format: Tagungsbericht
Sprache:eng
Schlagworte:
Concurrent computing
Contracts
Harmonic analysis
Information science
Laplace equations
Navigation
Orbital robotics
Parallel robots
Path planning
Regions
Online-Zugang:Volltext bestellen
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:A method for planning smooth robot paths is presented. The method relies on the use of Laplace's equation to constrain the generation of a potential function over regions of the configuration space of an effector. Once the function is computed, paths may be found very quickly. These functions do not exhibit the local minima which plague the potential field method. Unlike decompositional and algebraic techniques. Laplace's equation is very well suited to computation on massively parallel architectures.< >
DOI:10.1109/ROBOT.1990.126315