Linear Temporal Logic Motion Planning For Teams Of Underactuated Robots Using Satisfiability Modulo Convex Programming
2017 IEEE 56TH ANNUAL CONFERENCE ON DECISION AND CONTROL (CDC)(2017)
摘要
We present an efficient algorithm for multi-robot motion planning from linear temporal logic (LTL) specifications. We assume that the dynamics of each robot can be described by a discrete-time, linear system together with constraints on the control inputs and state variables. Given an LTL formula., specifying the multi-robot mission, our goal is to construct a set of collision-free trajectories for all robots, and the associated control strategies, to satisfy.. We show that the motion planning problem can be formulated as the feasibility problem for a formula. over Boolean and convex constraints, respectively capturing the LTL specification and the robot dynamics. We then adopt a satisfiability modulo convex (SMC) programming approach that exploits a monotonicity property of. to decompose the problem into smaller subproblems. Simulation results show that our algorithm is more than one order of magnitude faster than state-of-the-art sampling-based techniques for high-dimensional state spaces while supporting complex missions.
更多查看译文
关键词
discrete-time system,Linear temporal logic motion planning,underactuated robot teams,linear temporal logic specifications,multirobot motion,underactuated robots,high-dimensional state spaces,satisfiability modulo convex programming approach,robot dynamics,LTL specification,convex constraints,feasibility problem,motion planning problem,associated control strategies,collision-free trajectories,multirobot mission,LTL formula,state variables,linear system
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要