Hostname: page-component-7b7567c8c-tnkh4 Total loading time: 0 Render date: 2026-11-17T12:29:30.354Z Has data issue: false hasContentIssue false

SEQUENTIAL COLLISION-FREE OPTIMAL MOTION PLANNING ALGORITHMS IN PUNCTURED EUCLIDEAN SPACES

Published online by Cambridge University Press:  13 March 2020

CESAR A. IPANAQUE ZAPATA*
Affiliation:
Departamento de Matemática,Universidade de São Paulo, Instituto de Ciências Matemáticas e Computação – USP, Avenida Trabalhador São-carlense, 400 – Centro CEP: 13566-590 – São Carlos – SP, Brazil email cesarzapata@usp.br
JESÚS GONZÁLEZ
Affiliation:
Departamento de Matemáticas, Centro de Investigación y de Estudios Avanzados del IPN,Av. Instituto Politécnico Nacional 2508, San Pedro Zacatenco, Mexico City07000, México email jesus@math.cinvestav.mx
Rights & Permissions [Opens in a new window]

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the 'Save PDF' action button.

In robotics, a topological theory of motion planning was initiated by M. Farber. We present optimal motion planning algorithms which can be used in designing practical systems controlling objects moving in Euclidean space without collisions between them and avoiding obstacles. Furthermore, we present the multi-tasking version of the algorithms.

Information

Type
Research Article
Copyright
© 2020 Australian Mathematical Publishing Association Inc.