In this work, we present several tools for efficient sequential hierarchical least-squares programming (S-HLSP) for lexicographical optimization tailored to robot control and planning. As its main step, S-HLSP relies on approximations of the original non-linear hierarchical least-squares programming (NL-HLSP) to a hierarchical least-squares programming (HLSP) by the hierarchical Newton's method or the hierarchical Gauss-Newton algorithm. We present a threshold adaptation strategy for appropriate switches between the two. This ensures optimality of infeasible constraints, promotes numerical stability when solving the HLSP's and enhances optimality of lower priority levels by avoiding regularized local minima. We introduce the solver $\mathcal{N}$ADM$_2$, an alternating direction method of multipliers for HLSP based on nullspace projections of active constraints. The required basis of nullspace of the active constraints is provided by a computationally efficient turnback algorithm for system dynamics discretized by the Euler method. It is based on an upper bound on the bandwidth of linearly independent column subsets within the linearized constraint matrices. Importantly, an expensive initial rank-revealing matrix factorization is unnecessary. We show how the high sparsity of the basis in the fully-actuated case can be preserved in the under-actuated case. $\mathcal{N}$ADM$_2$ consistently shows faster computations times than competing off-the-shelf solvers on NL-HLSP composed of test-functions and whole-body trajectory optimization for fully-actuated and under-actuated robotic systems. We demonstrate how the inherently lower accuracy solutions of the alternating direction method of multipliers can be used to warm-start the non-linear solver for efficient computation of high accuracy solutions to non-linear hierarchical least-squares programs.
Lexicographic Minimum-Violation Motion Planning using Signal Temporal Logic
School of Computation, Information and Technology, Technical University of Munich(慕尼黑技术大学计算信息与技术学院);ZF Friedrichshafen AG(弗赖堡汽车集团);Institute of System Dynamics, HTWG Konstanz(康斯坦茨HTWG系统动力学研究所)
Two Techniques That Enhance the Performance of Multi-robot Prioritized Path Planning
Peoples' Friendship University of Russia (RUDN University)(俄罗斯人民友谊大学(卢蒙巴大学));Federal Research Center ``Computer Science and Control'' of Russian Academy of Sciences(俄罗斯科学院计算机科学与控制联邦研究中心);National Research University Higher School of Economics(国立研究型大学高等经济学院)
Monte-Carlo Tree Search with Prioritized Node Expansion for Multi-Goal Task Planning
Schaeffler Hub for Advanced Research at NTU(南洋理工大学舍弗勒高级研究中心);School of Mechanical and Aerospace Engineering, Nanyang Technological University(南洋理工大学机械与航空航天工程学院)
Prioritized Planning for Target-Oriented Manipulation via Hierarchical Stacking Relationship Prediction
National Key Laboratory of Human-Machine Hybrid Augmented Intelligence(人机混合增强智能国家重点实验室);National Engineering Research Center for Visual Information and Application(视觉信息与应用国家工程研究中心);Institute of Artificial Intelligence and Robotics(人工智能与机器人研究所);Xi’an Jiaotong University(西安交通大学)
Graph Coloring to Reduce Computation Time in Prioritized Planning
Chair of Embedded Software, RWTH Aachen University(亚琛工业大学嵌入式软件主席席位);Department of Aerospace Engineering, University of the Bundeswehr Munich(慕尼黑联邦国防军大学航空航天工程系)
Finding Near-optimal Solutions in Multi-robot Path Planning
Agent Technology Center, Dept. of Computer Science, Faculty of Electrical Engineering, CTU in Prague(布拉格捷克理工大学电气工程学院计算机科学系智能体技术中心);Algorithmics, EEMCS, Delft University of Technology(代尔夫特理工大学电气工程、数学与计算机科学学院算法组);iRobot Inc., Pasadena(iRobot公司(帕萨迪纳))
Efficient Multi-Robot Motion Planning with Precomputed Translation-Invariant Edge Bundles
Smead Aerospace Engineering Sciences, University of Colorado Boulder(科罗拉多大学博尔德分校航空航天工程科学系);Department of Computer Science, University of Colorado Boulder(科罗拉多大学博尔德分校计算机科学系);Cherry Creek High School, Greenwood Village, CO, USA(科罗拉多州格里诺村樱桃溪高中)
Learning Design and Construction with Varying-Sized Materials via Prioritized Memory Resets
Institute for Interdisciplinary Information Sciences, Tsinghua University(清华大学交叉信息研究院);ByteDance AI Lab(字节跳动人工智能实验室);University of California Santa Barbara(加州大学圣巴巴拉分校);Shanghai Qi Zhi Institute(上海期智研究院)
Prioritized Planning for Cooperative Range-Only Localization in Multi-Robot Networks
Massachusetts Institute of Technology(麻省理工学院);Woods Hole Oceanographic Institution(伍兹霍尔海洋研究所)
我们提出了一种新的路径规划算法,以减少定位误差的机器人网络合作定位通过机器人间的距离测量。利用距离测量进行定位的质量取决于网络的配置,并且差的配置可能导致大量的定位误差。为了减少网络配置对移动网络的定位误差的影响,我们考虑了Fisher信息矩阵(Fisher information matrix,简称HMF)的各种最优性测度,这些测度与定位误差之间的关系已经得到了很好的研究。特别是,我们提出了一个轨迹规划问题的约束条件的最优措施。通过约束这些最优性度量,我们可以控制定位误差的统计特性。为了有效地生成满足这些约束的轨迹,我们提出了一个优先级规划器,它利用基于图形的规划和独特的属性的范围内只有约束。我们在模拟实验中显示的结果表明,我们的算法生成的轨迹减少最坏情况下的定位误差高达42%相比,现有的规划方法,并可以可扩展地规划大量的机器人在复杂的环境中的距离有效的轨迹。
Multi-robot Path Planning in Well-formed Infrastructures: Prioritized Planning vs. Prioritized Wait Adjustment (Preliminary Results)
Peoples’ Friendship University of Russia (RUDN University)(俄罗斯人民友谊大学(RUDN大学));Federal Research Center “Computer Science and Control” of Russian Academy of Sciences(俄罗斯科学院“计算机科学与控制”联邦研究中心);National Research University Higher School of Economics(高等经济学院国家研究大学)
An Efficient Hybrid Route-Path Planning Model For Dynamic Task Allocation and Safe Maneuvering of an Underwater Vehicle in a Realistic Environment
College of Science and Engineering, Flinders University(弗林德斯大学科学与工程学院);Centre for Maritime Engineering, Control and Imaging, Flinders University(弗林德斯大学海事工程、控制与成像中心);Seattle Children's Research Institute, University of Washington(华盛顿大学西雅图儿童研究所)
Hierarchical Task Model Predictive Control for Sequential Mobile Manipulation Tasks
Learning Systems and Robotics Lab(学习系统与机器人实验室);Technical University of Munich(慕尼黑技术大学);University of Toronto Institute for Aerospace Studies(多伦多大学航空航天研究所);University of Toronto Robotics Institute(多伦多大学机器人研究所);Munich Institute of Robotics and Machine Intelligence(慕尼黑机器人与机器智能研究所);Vector Institute for Artificial Intelligence(人工智能向量研究所)
Auditable and Deployable Multi-Agent Motion Planning via Posetal Games from Legal Guidelines
Massachusetts Institute of Technology(麻省理工学院);Technical University of Munich(慕尼黑工业大学);Woods Hole Oceanographic Institution(伍兹霍尔海洋研究所);University of California, Berkeley(加州大学伯克利分校)
Multi-Robot Coordination for Planning under Context Uncertainty
Collaborative Robotics and Intelligent Systems (CoRIS) Institute, Oregon State University(俄勒冈州立大学协作机器人与智能系统研究所);Khoury College of Computer Sciences, Northeastern University(东北大学库里计算机科学学院)
Prioritized Multi-agent Path Finding for Differential Drive Robots
Federal Research Center for Computer Science and Control of RAS(俄罗斯科学院计算机科学与控制联邦研究中心);Higher School of Economics(高等经济学院);Peoples’ Friendship University of Russia (RUDN University)(俄罗斯人民友谊大学);Kurchatov Institute(库尔恰托夫研究所)
Ethics-Aware Safe Reinforcement Learning for Rare-Event Risk Control in Interactive Urban Driving
Chair of Econometrics and Statistics Corresponding author esp. in the Transport Sector(计量经济学与统计学教授职位(交通运输领域特别对应作者));Center for Scalable Data Analytics and Artificial Intelligence (ScaDS.AI)(可扩展数据与人工智能研究中心(ScaDS.AI))
Korea Advanced Institute of Science and Technology (KAIST)(韩国科学技术院);Korea Military Academy (KMA)(韩国军事学院);University of California, Riverside (UCR)(加州大学河滨分校);Omelet