2020/10/16 by Khadir, Bachir El, Lasserre, Jean Bernard, Sindhwani, Vikas · 1 citation
#FOS: Computer and information sciences #FOS: Mathematics #Optimization and Control (math.OC) #Robotics (cs.RO)
paper · doi:10.48550/arxiv.2010.08167
We propose a novel method for planning shortest length piecewise-linear motions through complex environments punctured with static, moving, or even morphing obstacles. Using a moment optimization approach, we formulate a hierarchy of semidefinite programs that yield increasingly refined lower bounds converging monotonically to the optimal path length. For computational tractability, our global moment optimization approach motivates an iterative motion planner that outperforms competing sampling-based and nonlinear optimization baselines. Our method natively handles continuous time constraints without any need for time discretization, and has the potential to scale better with dimensions compared to popular sampling-based methods.