Counterexample Guided Inductive Optimization Applied to Mobile Robots Path Planning (Extended Version)

08/14/2017
by   Rodrigo F. Araújo, et al.
0

We describe and evaluate a novel optimization-based off-line path planning algorithm for mobile robots based on the Counterexample-Guided Inductive Optimization (CEGIO) technique. CEGIO iteratively employs counterexamples generated from Boolean Satisfiability (SAT) and Satisfiability Modulo Theories (SMT) solvers, in order to guide the optimization process and to ensure global optimization. This paper marks the first application of CEGIO for planning mobile robot path. In particular, CEGIO has been successfully applied to obtain optimal two-dimensional paths for autonomous mobile robots using off-the-shelf SAT and SMT solvers.

READ FULL TEXT

Please sign up or login with your details

Forgot password? Click here to reset