Integration of a Graph-Based Path Planner and Mixed-Integer MPC for Robot Navigation in Cluttered Environments
The ability to update a path plan is a required capability for autonomous mobile robots navigating through uncertain environments. This paper proposes a re-planning strategy using a multilayer planning and control framework for cases where the robot's environment is partially known. A medial axis graph-based planner defines a global path plan based on known obstacles where each edge in the graph corresponds to a unique corridor. A mixed-integer model predictive control (MPC) method detects if a terminal constraint derived from the global plan is infeasible, subject to a non-convex description of the local environment. Infeasibility detection is used to trigger efficient global re-planning via medial axis graph edge deletion. The proposed re-planning strategy is demonstrated experimentally.
Code (0)
등록된 구현이 없습니다.
Tasks
Model Predictive ControlRobot NavigationSimilar Papers 제목 키워드 기반
On Kinodynamic Global Planning in a Simplicial Complex Environment: A Mixed Integer Approach
This work casts the kinodynamic planning problem for car-like vehicles as an optimization task to compute a minimum-time trajectory and its associated velocity profile, subject to boundary conditions on velocity, acceler…
Socially Consistent Multi-Robot Navigation Using Decoupled Planning and Trajectory Coordination
The successful integration of mobile robots in human-centric environments requires navigation that is not only safe and efficient, but also consistent and compliant with social conventions: key precursors for human comfo…
Robot NavigationMixed Integer Programming for Time-Optimal Multi-Robot Coverage Path Planning with Efficient Heuristics
We investigate time-optimal Multi-Robot Coverage Path Planning (MCPP) for both unweighted and weighted terrains, which aims to minimize the coverage time, defined as the maximum travel time of all robots. Specifically, w…
Model OptimizationFinding Thermodynamically Favorable Pathways in Chemical Reaction Networks Using Flows in Hypergraphs and Mixed-Integer Linear Programming
The search for pathways that optimize the formation of a particular target molecule in a reaction network is a key problem in many settings, including reactor systems. Chemical reaction networks are mathematically well r…
Informative Path Planning in Random Fields via Mixed Integer Programming
We present a new mixed integer formulation for the discrete informative path planning problem in random fields. The objective is to compute a budget constrained path while collecting measurements whose linear estimate re…