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

Collision-Free Encoding for Chance-Constrained Nonconvex Path Planning

Full text
Arantes, Marcio da Silva [1] ; Motta Toledo, Claudio Fabiano [2] ; Williams, Brian Charles [3] ; Ono, Masahiro [4]
Total Authors: 4
[1] SENAI Innovat Inst Embedded Syst, BR-88056020 Florianopolis, SC - Brazil
[2] Univ Sao Paulo, Inst Math & Comp Sci, BR-13566590 Sao Carlos, SP - Brazil
[3] MIT, Comp Sci & Artificial Intelligence Lab, 77 Massachusetts Ave, Cambridge, MA 02139 - USA
[4] CALTECH, Jet Prop Lab, 4800 Oak Grove Dr, Pasadena, CA 91125 - USA
Total Affiliations: 4
Document type: Journal article
Source: IEEE Transactions on Robotics; v. 35, n. 2, p. 433-448, APR 2019.
Web of Science Citations: 0

The path planning methods based on nonconvex constrained optimization, such as mixed-integer linear programming (MILP), have found various important applications, ranging from unmanned aerial vehicles (UAVs) and autonomous underwater vehicles (AUVs) to space vehicles. Moreover, their stochastic extensions have enabled risk-aware path planning, which explicitly limits the probability of failure to a user-specified bound. However, a major challenge of those path planning methods is constraint violation between discrete time steps. In the existing approach, a path is represented by a sequence of waypoints and the safety constraints (e.g., obstacle avoidance) are imposed on waypoints. Therefore, the trajectory between waypoints could violate the safety constraints. A naive continuous-time extension results in unrealistic computation cost. In this paper, we propose a novel approach to ensure constraint satisfaction between waypoints without employing a continuous-time formulation. The key idea is to enforce that the same inequality constraint is satisfied on any two adjacent time steps, under assumptions of polygonal obstacles and straight line trajectory between waypoints. The resulting problem encoding is MILP, which can be solved efficiently by commercial solvers. Thus, we also introduce novel extensions to risk-allocation path planners with improved scalability for real-world scenarios and run-time performance. While the proposed encoding approach is general, the particular emphasis of this paper is placed on the chance-constrained, nonconvex path-planning problem (CNPP). We provide extensive simulation results on CNPP to demonstrate the path safety and scalability of our encoding and related path planners. (AU)

FAPESP's process: 13/07375-0 - CeMEAI - Center for Mathematical Sciences Applied to Industry
Grantee:José Alberto Cuminato
Support type: Research Grants - Research, Innovation and Dissemination Centers - RIDC
FAPESP's process: 14/11331-0 - Hybrid qualitative state plan and mission planning problem with UAVs
Grantee:Márcio da Silva Arantes
Support type: Scholarships in Brazil - Doctorate
FAPESP's process: 14/12297-0 - Mission planning in UAVs with risk of critical failure: a security-based approach
Grantee:Jesimar da Silva Arantes
Support type: Scholarships in Brazil - Master