Multitasking collision-free motion planning algorithms in Euclidean spaces
Universidade de São Paulo（圣保罗大学）；Instituto de Ciências Matemáticas e de Computação - USP（USP数学与计算机科学研究所）；Centro de Investigación y de Estudios Avanzados del I. P. N.（墨西哥国立理工学院高级研究中心）
Cesar A. Ipanaque Zapata, Jesus Gonzalez
备注：
17 pages
发表信息：
Discrete Mathematics, Algorithms and Applications, v. 12, no. 3 (2020)
We present optimal motion planning algorithms which can be used in designing practical systems controlling objects moving in Euclidean space without collisions. Our algorithms are optimal in a very concrete sense, namely, they have the minimal possible number of local planners. Our algorithms are motivated by those presented by Mas-Ku and Torres-Giese (as streamlined by Farber), and are developed within the more general context of the multitasking (a.k.a.~higher) motion planning problem. In addition, an eventual implementation of our algorithms is expected to work more efficiently than previous ones when applied to systems with a large number of moving objects.
This paper proposes a novel online motion planning approach to robot navigation based on nonlinear model predictive control. Common approaches rely on pure Euclidean optimization parameters. In robot navigation, however, state spaces often include rotational components which span over non-Euclidean rotation groups. The proposed approach applies nonlinear increment and difference operators in the entire optimization scheme to explicitly consider these groups. Realizations include but are not limited to quadratic form and time-optimal objectives. A complex parking scenario for the kinematic bicy…
This is a continuation of our recent paper in which we developed the theory of sequential parametrized motion planning. A sequential parametrized motion planning algorithm produced a motion of the system which is required to visit a prescribed sequence of states, in a certain order, at specified moments of time. In the previous publication we analysed the sequential parametrized topological complexity of the Fadell - Neuwirth fibration which in relevant to the problem of moving multiple robots avoiding collisions with other robots and with obstacles in the Euclidean space. Besides, in the prec…
Queen Mary University of London（伦敦玛丽女王大学）；The University of Chicago（芝加哥大学）
In this paper we study paramertized motion planning algorithms which provide universal and flexible solutions to diverse motion planning problems. Such algorithms are intended to function under a variety of external conditions which are viewed as parameters and serve as part of the input of the algorithm. Continuing a recent paper, we study further the concept of parametrized topological complexity. We analyse in full detail the problem of controlling a swarm of robots in the presence of multiple obstacles in Euclidean space which served for us a natural motivating example. We present an expli…
Induced Riemannian Metrics for Motion Planning with Constraints
University of Toronto Institute for Aerospace Studies (UTIAS)（多伦多大学航空航天研究所）；Massachusetts Institute of Technology Computer Science and Artificial Intelligence Laboratory (MIT CSAIL)（麻省理工学院计算机科学与人工智能实验室）
Efficient Collision Detection for Long and Slender Robotic Links in Euclidean Distance Fields: Application to a Forestry Crane
Automation & Control Institute (ACIN), TU Wien（自动化与控制研究所（ACIN），维也纳技术大学）；Center for Vision, Automation & Control, AIT Austrian Institute of Technology GmbH（视觉、自动化与控制中心，奥地利技术研究所）
Department of Computer Science, Texas State University（德克萨斯州立大学计算机科学系）；Robotics Institute, Carnegie Mellon University（卡内基梅隆大学机器人研究所）
Search-based techniques have shown great success in motion planning problems such as robotic navigation by discretizing the state space and precomputing motion primitives. However in domains with complex dynamic constraints, constructing motion primitives in a discretized state space is non-trivial. This requires operating in continuous space which can be challenging for search-based planners as they can get stuck in local minima regions. Previous work on planning in continuous spaces introduced soft duplicate detection which requires search to compute the duplicity of a state with respect to …
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·艾伦计算机科学与工程学院）
Aeronautics Institute of Technology (ITA)（航空技术研究所（ITA））
This paper presents a Robot Operating System and Gazebo application to calculate and simulate an optimal route for a drone in an urban environment by developing new ROS packages and executing them along with open-source tools. Firstly, the current regulations about UAS are presented to guide the building of the simulated environment, and multiple path planning algorithms are reviewed to guide the search method selection. After selecting the A-star algorithm, both the 2D and 3D versions of them were implemented in this paper, with both Manhattan and Euclidean distances heuristics. The performan…
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（加泰罗尼亚理工大学工业与控制工程研究所）
This work investigates the use of Neural implicit representations, specifically Neural Radiance Fields (NeRF), for geometrical queries and motion planning. We show that by adding the capacity to infer occupancy in a radius to a pre-trained NeRF, we are effectively learning an approximation to a Euclidean Signed Distance Field (ESDF). Using backward differentiation of the augmented network, we obtain an obstacle gradient that is integrated into an obstacle avoidance policy based on the Riemannian Motion Policies (RMP) framework. Thus, our findings allow for very fast sampling-free obstacle avoi…
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）
An RRT* algorithm based on Riemannian metric model for optimal path planning
School of Mathematics and Statistics（数学与统计学学院）；Huazhong University of Science and Technology（华中科技大学）；Hubei Key Laboratory of Engineering Modeling and Scientific Computing（湖北省工程建模与科学计算重点实验室）
University of Oxford（牛津大学）；Ocado Technology（奥卡多科技公司）
In this paper, we present a new algorithm that extends RRT* and RT-RRT* for online path planning in complex, dynamic environments. Sampling-based approaches often perform poorly in environments with narrow passages, a feature common to many indoor applications of mobile robots as well as computer games. Our method extends RRT-based sampling methods to enable the use of an assisting distance metric to improve performance in environments with obstacles. This assisting metric, which can be any metric that has better properties than the Euclidean metric when line of sight is blocked, is used in co…
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（多伦多大学航空航天研究所）
Digital Twin-Guided Robot Path Planning: A Beta-Bernoulli Fusion with Large Language Model as a Sensor
Department of Civil, Construction, and Environmental Engineering, San Diego State University, San Diego, CA, United States（土木、建设与环境工程系，圣地亚哥州立大学，美国圣地亚哥，加利福尼亚州）；Department of Electrical and Computer Engineering, University of California, San Diego, San Diego, CA, United States（电气与计算机工程系，加州大学圣地亚哥分校，美国圣地亚哥，加利福尼亚州）
Efficient and Real-Time Motion Planning for Robotics Using Projection-Based Optimization
Department of Control Science and Engineering, Zhejiang University（控制科学与工程系，浙江大学）；Swiss Cobotics Competence Center（瑞士协作机器人能力建设中心）；Idiap Research Institute（Idiap研究机构）；EPFL（瑞士联邦理工学院）
Aurora Innovation Inc.（奥罗拉创新公司）；Paul G. Allen School of Computer Science and Engineering, University of Washington（华盛顿大学保罗·G·艾伦计算机科学与工程学院）
Sampling-based motion planners rely on incremental densification to discover progressively shorter paths. After computing feasible path $ξ$ between start $x_s$ and goal $x_t$, the Informed Set (IS) prunes the configuration space $\mathcal{C}$ by conservatively eliminating points that cannot yield shorter paths. Densification via sampling from this Informed Set retains asymptotic optimality of sampling from the entire configuration space. For path length $c(ξ)$ and Euclidean heuristic $h$, $IS = \{ x | x \in \mathcal{C}, h(x_s, x) + h(x, x_t) \leq c(ξ) \}$. Relying on the heuristic can render t…
This paper presents Learning-based Autonomous Guidance with RObustness and Stability guarantees (LAG-ROS), which provides machine learning-based nonlinear motion planners with formal robustness and stability guarantees, by designing a differential Lyapunov function using contraction theory. LAG-ROS utilizes a neural network to model a robust tracking controller independently of a target trajectory, for which we show that the Euclidean distance between the target and controlled trajectories is exponentially bounded linearly in the learning error, even under the existence of bounded external dis…
The Chinese University of Hong Kong（香港中文大学）；Carnegie Mellon University（卡内基梅隆大学）
This paper presents a fundamental algorithm, called VDB-EDT, for Euclidean distance transform (EDT) based on the VDB data structure. The algorithm executes on grid maps and generates the corresponding distance field for recording distance information against obstacles, which forms the basis of numerous motion planning algorithms. The contributions of this work mainly lie in three folds. Firstly, we propose a novel algorithm that can facilitate distance transform procedures by optimizing the scheduling priorities of transform functions, which significantly improves the running speed of conventi…
University of Toronto Institute for Aerospace Studies（多伦多大学航空航天研究所）；Technical University of Munich（慕尼黑工业大学）；Vector Institute for Artificial Intelligence（向量人工智能研究所）；University of Tartu（塔尔图大学）
This paper presents a scalable online algorithm to generate safe and kinematically feasible trajectories for quadrotor swarms. Existing approaches rely on linearizing Euclidean distance-based collision constraints and on axis-wise decoupling of kinematic constraints to reduce the trajectory optimization problem for each quadrotor to a quadratic program (QP). This conservative approximation often fails to find a solution in cluttered environments. We present a novel alternative that handles collision constraints without linearization and kinematic constraints in their quadratic form while still…
ETRI（韩国电子通信研究院）；KAIST（韩国科学技术院）；NASA-JPL（美国国家航空航天局喷气推进实验室）；California Institute of Technology（加州理工学院）
Collision-free path planning is an essential requirement for autonomous exploration in unknown environments, especially when operating in confined spaces or near obstacles. This study presents an autonomous exploration technique using a small drone. A local end-point selection method is designed using LiDAR range measurement and then generates the path from the current position to the selected end-point. The generated path shows the consistent collision-free path in real-time by adopting the Euclidean signed distance field-based grid-search method. The simulation results consistently showed th…
Unified Linear Parametric Map Modeling and Perception-aware Trajectory Planning for Mobile Robotics
School of Information Science and Engineering, Shenyang University of Technology（沈阳理工大学信息科学与工程学院）；State Key Laboratory of Synthetic Automation for Process Industries, Northeastern University（东北大学过程工业综合自动化重点实验室）；State Key Laboratory of Robotics, Shenyang Institute of Automation, Chinese Academy of Sciences（中国科学院沈阳自动化研究所机器人重点实验室）；University of Chinese Academy of Sciences（中国科学院大学）
