Constrained Motion Planning (CMP) aims to find a collision-free path between the given start and goal configurations on the kinematic constraint manifolds. These problems appear in various scenarios ranging from object manipulation to legged-robot locomotion. However, the zero-volume nature of manifolds makes the CMP problem challenging, and the state-of-the-art methods still take several seconds to find a path and require a computationally expansive path dataset for imitation learning. Recently, physics-informed motion planning methods have emerged that directly solve the Eikonal equation through neural networks for motion planning and do not require expert demonstrations for learning. Inspired by these approaches, we propose the first physics-informed CMP framework that solves the Eikonal equation on the constraint manifolds and trains neural function for CMP without expert data. Our results show that the proposed approach efficiently solves various CMP problems in both simulation and real-world, including object manipulation under orientation constraints and door opening with a high-dimensional 6-DOF robot manipulator. In these complex settings, our method exhibits high success rates and finds paths in sub-seconds, which is many times faster than the state-of-the-art CMP methods.
TUM School of Computation, Information and Technology, Technical University of Munich（慕尼黑工业大学计算、信息与技术学院）；TUM School of Engineering and Design, Technical University Munich（慕尼黑工业大学工程与设计学院）
GAIDE: Graph-based Attention Masking for Spatial- and Embodiment-aware Motion Planning
J. Mike Walker ’66 Department of Mechanical Engineering, Texas A&M University, College Station, TX 77843, USA（J. Mike Walker ’66 机械工程系，德克萨斯A&M大学，College Station, TX 77843, USA）；Zachry Department of Civil and Environmental Engineering, Texas A&M University, College Station, TX 77843 USA（Zachry 市政与环境工程系，德克萨斯A&M大学，College Station, TX 77843 USA）
Wake-Informed 3D Path Planning for Autonomous Underwater Vehicles Using A* and Neural Network Approximations
Centre for Defence Engineering, Research and Training (CDERT), Flinders University（国防工程研究与培训中心（CDERT）、弗林德斯大学）；Maritime Engineering, Faculty of Engineering and Physical Sciences, University of Southampton（海洋工程系，工程与物理科学学院，南安普顿大学）
RIT*: Riemannian Informed Trees for Cost-Adaptive Optimal Motion Planning
Center for Autonomous Robotic Systems, Khalifa University（哈利法大学自主机器人系统中心）；Institute of Industrial and Control Engineering, Universitat Politècnica de Catalunya（加泰罗尼亚理工大学工业与控制工程研究所）
Flexible Informed Trees (FIT*): Adaptive Batch-Size Approach in Informed Sampling-Based Path Planning
Department of Informatics, Technical University of Munich（信息学院，慕尼黑技术大学）；Department of Technology & Innovation, KION Group Linde Material Handling GmbH（技术与创新学院，KION集团Linde物料处理 GmbH）
Informed Sampling for Asymptotically Optimal Path Planning (Consolidated Version)
Carnegie Mellon University（卡内基梅隆大学）；Massachusetts Institute of Technology（麻省理工学院）；University of Toronto（多伦多大学）；University of Waterloo（滑铁卢大学）；University of Toronto Institute for Aerospace Studies（多伦多大学航空航天研究所）
Institute for Anthropomatics and Robotics, Karlsruhe Institute of Technology（卡尔斯鲁厄理工学院人类工程与机器人研究所）；Robotics and Autonomous Systems, Institute of Applied Research, Karlsruhe University of Applied Sciences（卡尔斯鲁厄应用技术大学应用研究所机器人与自主系统部）
Generalizing Informed Sampling for Asymptotically Optimal Sampling-based Kinodynamic Planning via Markov Chain Monte Carlo
Robotics Institute, Carnegie Mellon University（卡内基梅隆大学机器人研究所）；Paul G. Allen School of Computer Science & Engineering, University of Washington（华盛顿大学保罗·G·艾伦计算机科学与工程学院）
Batch Informed Trees (BIT*): Informed Asymptotically Optimal Anytime Search
Carnegie Mellon University（卡内基梅隆大学）；Massachusetts Institute of Technology（麻省理工学院）；University of Toronto（多伦多大学）；University of Waterloo（滑铁卢大学）；University of Toronto Institute for Aerospace Studies（多伦多大学航空航天研究所）
Estimated Informed Anytime Search for Sampling-Based Planning via Adaptive Sampler
Chair of Robotics, Artificial Intelligence and Real-time Systems, TUM School of Computation, Information and Technology (CIT), Technical University of Munich（机器人、人工智能与实时系统教授会，技术大学慕尼黑计算、信息与技术学院）；Chair of Robotics and Systems Intelligence, Munich Institute of Robotics and Machine Intelligence (MIRMI), Technical University of Munich（机器人与系统智能教授会，慕尼黑机器人与机器智能研究所，技术大学慕尼黑）；State Key Laboratory for Novel Software Technology and the School of Science and Technology, Nanjing University (Suzhou Campus)（新型软件技术国家重点实验室和南京大学（苏州校区）科学与技术学院）；School of Control Science and Engineering, Shandong University（控制科学与工程学院，山东大学）
Just in time Informed Trees: Manipulability-Aware Asymptotically Optimized Motion Planning
Human-Robot Interfaces and Interaction(HRI2), Istituto Italiano Di Tecnologia (IIT)（人机交互（HRI2），意大利技术研究所（IIT））；Swiss Federal Technology Institute of Lausanne (EPFL)（洛桑联邦理工学院（EPFL））；Technical University of Munich（慕尼黑技术大学）；School of Control Science and Engineering, Shandong University（控制科学与工程学院，山东大学）；School of Computer Science, University of Nottingham, UK（计算机科学学院，诺丁汉大学（英国））
Nearest-Neighbourless Asymptotically Optimal Motion Planning with Fully Connected Informed Trees (FCIT*)
Estimation, Search, and Planning (ESP) Research Group, Queen’s University, Kingston ON, Canada（皇后大学估计、搜索与规划研究组）；Department of Computer Science, Rice University, Houston TX, USA（里士满大学计算机科学系）；Department of Computer Science, Purdue University, West Lafayette IN, USA（普渡大学计算机科学系）；Ken Kennedy Institute, Rice University, Houston TX, USA（里士满大学肯尼迪研究所）
Greedy Heuristics for Sampling-Based Motion Planning in High-Dimensional State Spaces
University of Toronto Institute for Aerospace Studies（多伦多大学航空航天研究所）；Ton Duc Thang University（越南 ton duc thang 大学（东德盛大学））；Singapore University of Technology and Design（新加坡科技设计大学）
Hierarchical Experience-informed Navigation for Multi-modal Quadrupedal Rebar Grid Traversal
Georgia Institute of Technology（佐治亚理工学院）；School of Mechanical Engineering, Georgia Institute of Technology（佐治亚理工学院机械工程学院）；SkyMul Inc（SkyMul公司）；School of Electrical and Computer Engineering, Georgia Institute of Technology（佐治亚理工学院电气与计算机工程学院）
