Advanced search
Start date
Betweenand
(Reference retrieved automatically from Web of Science through information on FAPESP grant and its corresponding number as mentioned in the publication by the authors.)

Multitasking collision-free optimal motion planning algorithms in Euclidean spaces

Full text
Author(s):
Ipanaque Zapata, Cesar A. [1] ; Gonzalez, Jesus [2]
Total Authors: 2
Affiliation:
[1] Univ Sao Paulo, Inst Ciencias Matemat & Comp, Dept Matemat, Ave Trabalhador Sao Carlense 400, BR-13566590 Sao Carlos, SP - Brazil
[2] Inst Politecn Nacl, Dept Matemat, Ctr Invest & Estudios Avanzados IPN Av, Numero 2508, Mexico City 07000, DF - Mexico
Total Affiliations: 2
Document type: Journal article
Source: DISCRETE MATHEMATICS ALGORITHMS AND APPLICATIONS; v. 12, n. 3 JUN 2020.
Web of Science Citations: 0
Abstract

We present optimal motion planning algorithms which can be used in designing practical systems controlling objects moving in Euclidean space without collisions. Our algorithms are optimal in a very concrete sense, namely, they have the minimal possible number of local planners. Our algorithms are motivated by those presented by Mas-Ku and Torres-giese (as streamlined by Farber), and are developed within the more general context of the multitasking (a.k.a. higher) motion planning problem. In addition, an eventual implementation of our algorithms is expected to work more efficiently than previous ones when applied to systems with a large number of moving objects. (AU)

FAPESP's process: 18/23678-6 - Configuration spaces in collision free simultaneous Motion Planning Problem
Grantee:Cesar Augusto Ipanaque Zapata
Support Opportunities: Scholarships abroad - Research Internship - Doctorate