Real-Time-Feasible Collision-Free Motion Planning For Ellipsoidal Objects
Robert Bosch GmbH, Corporate Research(罗伯特·博世有限公司,企业研究);Department of Microsystems Engineering (IMTEK), University of Freiburg(弗赖堡大学微系统工程系(IMTEK));School of Information Science and Technology, ShanghaiTech University(上海科技大学信息科学与技术学院);Department of Mathematics, University of Freiburg(弗赖堡大学数学系)
Yunfan Gao, Florian Messerer, Niels van Duijkeren, Boris Houska, Moritz Diehl
备注:
This version corrects a typographical error in the proof of Lemma 3. Although the original proof contained a mistake, the statement of the lemma remains valid and unchanged
Online planning of collision-free trajectories is a fundamental task for robotics and self-driving car applications. This paper revisits collision avoidance between ellipsoidal objects using differentiable constraints. Two ellipsoids do not overlap if and only if the endpoint of the vector between the center points of the ellipsoids does not lie in the interior of the Minkowski sum of the ellipsoids. This condition is formulated using a parametric over-approximation of the Minkowski sum, which can be made tight in any given direction. The resulting collision avoidance constraint is included in an optimal control problem (OCP) and evaluated in comparison to the separating-hyperplane approach. Not only do we observe that the Minkowski-sum formulation is computationally more efficient in our experiments, but also that using pre-determined over-approximation parameters based on warm-start trajectories leads to a very limited increase in suboptimality. This gives rise to a novel real-time scheme for collision-free motion planning with model predictive control (MPC). Both the real-time feasibility and the effectiveness of the constraint formulation are demonstrated in challenging real-world experiments.
Efficient Probabilistic Planning with Maximum-Coverage Distributionally Robust Backward Reachable Trees
Laboratory for Information and Decision Systems, Massachusetts Institute of Technology(信息与决策系统实验室,麻省理工学院);Draper, Cambridge MA 02139(Draper,剑桥MA 02139)
A Real-Time Framework for Intermediate Map Construction and Kinematically Feasible Off-Road Planning Without OSM
School of Computer Science, University of Lincoln, United Kingdom(林肯大学计算机科学学院);Center of Autonomous Technologies, Innopolis University, Innopolis, Russia(伊诺波利斯大学自主技术中心)
SMART: Scalable Multi-Agent Reasoning and Trajectory Planning in Dense Environments
Department of Civil and Environmental Engineering University of Wisconsin-Madison(威斯康星大学麦迪逊分校土木与环境工程系);School of Vehicle and Mobility, Tsinghua University(清华大学车辆与移动性学院);Department of Civil Engineering, The University of Hong Kong(香港大学土木工程系)
Open-Source, Cost-Aware Kinematically Feasible Planning for Mobile and Surface Robotics
Open Navigation LLC;Carnegie Mellon University(卡内基梅隆大学);Locus Robotics;QUT Centre for Robotics and School of Electrical Engineering and Robotics(QUT机器人中心和电气工程与机器人学院)
Hierarchical Planning of Dynamic Movements without Scheduled Contact Sequences
Department of Advanced Robotics, Istituto Italiano di Tecnologia(意大利技术研究院先进机器人部);Robot Learning and Interaction Group, Idiap Research Institute(伊迪普研究所机器人学习与交互小组)
Receding Horizon Motion Planning for Multi-Agent Systems: A Velocity Obstacle Based Probabilistic Method
NUS Graduate School for Integrative Sciences and Engineering(新加坡国立大学综合科学与工程研究生院);National University of Singapore(新加坡国立大学);University of California, Berkeley(加州大学伯克利分校);Temasek Laboratories(淡马锡实验室)
Augmenting GRIPS with Heuristic Sampling for Planning Feasible Trajectories of a Car-Like Robot
Moscow Institute of Physics and Technology(莫斯科物理技术学院);LLC “Integrant”(Integrant有限责任公司);Federal Research Center “Computer Science and Control” RAS(俄罗斯科学院联邦研究中心“计算机科学与控制”)
Learning feasible transitions for efficient contact planning
Mohamed bin Zayed University of Artificial Intelligence (MBZUAI)(穆罕默德·本·扎耶德人工智能大学(MBZUAI));Munich Institute of Robotics and Machine Intelligence, Technical University of Munich(慕尼黑工业大学慕尼黑机器人与机器智能研究所)
Learning-based Fast Path Planning in Complex Environments
The Chinese University of Hong Kong(香港中文大学);Baidu Research(百度研究院);Tencent Robotics X(腾讯机器人X实验室);Soochow University(苏州大学);Southern University of Science and Technology(南方科技大学);Shenzhen Research Institute of the Chinese University of Hong Kong(香港中文大学深圳研究院)
Motion Planning of Cooperative Nonholonomic Mobile Manipulators
Department of Mechanical Engineering, Indian Institute of Technology Bombay(印度理工学院班加罗尔机械工程系);Center for Systems and Control, Indian Institute of Technology Bombay(印度理工学院班加罗尔系统控制中心)
Bi-Level Optimization for Contact and Motion Planning in Rope-Assisted Legged Robots
Dipartimento di Ingegneria e Scienza dell’Informazione (DISI), University of Trento(工程与信息科学系(DISI),特伦托大学);Inria, Université de Lorraine, CNRS(法国国家信息与自动化技术研究院(Inria)、洛林大学、法国国家科学研究中心(CNRS))
A Comparison of Reinforcement Learning and Optimal Control Methods for Path Planning
Department of Electrical and Computer Engineering, Hampton University(哈珀学院电气与计算机工程系);Air Warfare Directorate, Air Force Research Laboratory(空军研究实验室空战 Directorate)