2012 IEEE International Conference on Robotics and Automation 2012
DOI: 10.1109/icra.2012.6225141
|View full text |Cite
|
Sign up to set email alerts
|

Mathematical programming for Multi-Vehicle Motion Planning problems

Abstract: To demonstrate the use of this framework for the formulation and solution of MVMP problems, we examine in detail four representative works and summarize several other related works. As MP solution algorithms and associated numerical solvers continue to develop, we anticipate that MP solution techniques will be applied to an increasing number of MVMP problems and that the framework and formulations presented in this paper may serve as a guide for future MVMP research.

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1

Citation Types

0
9
0

Year Published

2013
2013
2024
2024

Publication Types

Select...
4
4
2

Relationship

0
10

Authors

Journals

citations
Cited by 31 publications
(9 citation statements)
references
References 37 publications
0
9
0
Order By: Relevance
“…This usually is achieved using mixed integer linear programming (MILP) constraints to model obstacles as multiple convex polygons. 2 Currently, this is commonly used for MPC approaches.…”
mentioning
confidence: 99%
“…This usually is achieved using mixed integer linear programming (MILP) constraints to model obstacles as multiple convex polygons. 2 Currently, this is commonly used for MPC approaches.…”
mentioning
confidence: 99%
“…Fukushima et al (2013) reduced an optimal control problem to mixed-integer quadratic programming (MIQP) problem for multiple vehicles formation. For a review of mathematical programming techniques applied to motion planning problems see Abichandani et al (2012).…”
Section: Accepted Manuscriptmentioning
confidence: 99%
“…It determines how safely the mobile robot reaches its goal position (GP) taken into account several criteria such as shortest distance and minimum energy. Several methodologies have been suggested to solve path planning problem, among them the classical approaches such as, mathematical programming, 1 cell decomposition, 2 roadmap approach, 3 and potential fields. 4 The most downsides of these techniques are their inefficiency due to the high computational cost and inaccuracy due to the trapping in the local minimum.…”
Section: Introductionmentioning
confidence: 99%