English
Related papers

Related papers: Safe Bubble Cover for Motion Planning on Distance …

200 papers

Generating safe motion plans in real-time is necessary for the wide-scale deployment of robots in unstructured and human-centric environments. These motion plans must be safe to ensure humans are not harmed and nearby objects are not…

Robotics · Computer Science 2024-02-15 Jonathan Michaux , Adam Li , Qingyi Chen , Che Chen , Bohao Zhang , Ram Vasudevan

We propose an algorithmic framework for efficient anytime motion planning on large dense geometric roadmaps, in domains where collision checks and therefore edge evaluations are computationally expensive. A large dense roadmap (graph) can…

In this paper, we propose a novel optimization-based trajectory planner that utilizes spherical harmonics to estimate the collision-free solution space around an agent. The space is estimated using a constrained over-determined…

Robotics · Computer Science 2021-07-16 Steven Patrick , Efstathios Bakolas

Demand for fast and economical parcel deliveries in urban environments has risen considerably in recent years. A framework envisions efficient last-mile delivery in urban environments by leveraging a network of ride-sharing vehicles, where…

Robotics · Computer Science 2021-03-16 Gabriel Barsi Haberfeld , Aditya Gahlawat , Naira Hovakimyan

Navigating safely in urban environments remains a challenging problem for autonomous vehicles. Occlusion and limited sensor range can pose significant challenges to safely navigate among pedestrians and other vehicles in the environment.…

Robotics · Computer Science 2019-07-19 Ming-Yuan Yu , Ram Vasudevan , Matthew Johnson-Roberson

Feedback motion planning over cell decompositions provides a robust method for generating collision-free robot motion with formal guarantees. However, existing algorithms often produce paths with unnecessary bending, leading to slower…

Robotics · Computer Science 2026-04-16 Aref Amiri , Steven M. LaValle

This paper presents an optimisation-based approach for an obstacle avoidance problem within an autonomous vehicle racing context. Our control regime leverages online reachability analysis and sensor data to compute the maximal safe…

Multiagent Systems · Computer Science 2023-11-17 Sergiy Bogomolov , Taylor T. Johnson , Diego Manzanas Lopez , Patrick Musau , Paulius Stankaitis

Unlike squared (or alike) quadrotors, elongated bi-copters leverage natural superiority in crossing tight spaces. To date, extensive works have focused on the design, modeling, and control of bi-copters. Besides, a proper motion planner…

Robotics · Computer Science 2024-06-04 Xin Dong , Yangjie Cui , Jingwu Xiang , Daochun Li , Zhan Tu

Trajectory generation in dynamic environments presents a significant challenge for quadrotors, particularly due to the non-convexity in the spatial-temporal domain. Many existing methods either assume simplified static environments or…

Robotics · Computer Science 2025-03-19 Songhao Huang , Yuwei Wu , Yuezhan Tao , Vijay Kumar

As drones and autonomous cars become more widespread it is becoming increasingly important that robots can operate safely under realistic conditions. The noisy information fed into real systems means that robots must use estimates of the…

Robotics · Computer Science 2017-06-01 Brian Axelrod , Leslie Pack Kaelbling , Tomás Lozano-Pérez

Flow-based methods for sampling and generative modeling use continuous-time dynamical systems to represent a {transport map} that pushes forward a source measure to a target measure. The introduction of a time axis provides considerable…

Machine Learning · Statistics 2025-06-19 Panos Tsimpos , Zhi Ren , Jakob Zech , Youssef Marzouk

Picking an item in the presence of other objects can be challenging as it involves occlusions and partial views. Given object models, one approach is to perform object pose estimation and use the most likely candidate pose per object to…

Robotics · Computer Science 2020-08-12 Rui Wang , Chaitanya Mitash , Shiyang Lu , Daniel Boehm , Kostas E. Bekris

Modern sampling-based motion planning algorithms typically take between hundreds of milliseconds to dozens of seconds to find collision-free motions for high degree-of-freedom problems. This paper presents performance improvements of more…

Robotics · Computer Science 2023-10-02 Wil Thomason , Zachary Kingston , Lydia E. Kavraki

Robot motion planning is central to real-world autonomous applications, such as self-driving cars, persistence surveillance, and robotic arm manipulation. One challenge in motion planning is generating control signals for nonlinear systems…

Robotics · Computer Science 2019-10-08 Guang Yang , Bee Vang , Zachary Serlin , Calin Belta , Roberto Tron

Robots will increasingly operate near humans that introduce uncertainties in the motion planning problem due to their complex nature. Typically, chance constraints are introduced in the planner to optimize performance while guaranteeing…

Robotics · Computer Science 2023-07-04 Oscar de Groot , Laura Ferranti , Dariu Gavrila , Javier Alonso-Mora

Control barrier functions are widely used to enforce safety properties in robot motion planning and control. However, the problem of constructing barrier functions online and synthesizing safe controllers that can deal with the associated…

Robotics · Computer Science 2021-02-12 Kehan Long , Cheng Qian , Jorge Cortés , Nikolay Atanasov

In recent years, mobile robots are becoming ambitious and deployed in large-scale scenarios. Serving as a high-level understanding of environments, a sparse skeleton graph is beneficial for more efficient global planning. Currently,…

Robotics · Computer Science 2022-08-09 Xinyi Chen , Boyu Zhou , Jiarong Lin , Yichen Zhang , Fu Zhang , Shaojie Shen

Pipeline parallelism is one of the key components for large-scale distributed training, yet its efficiency suffers from pipeline bubbles which were deemed inevitable. In this work, we introduce a scheduling strategy that, to our knowledge,…

Distributed, Parallel, and Cluster Computing · Computer Science 2024-01-22 Penghui Qi , Xinyi Wan , Guangxing Huang , Min Lin

We study the problem of planning paths for $p$ distinguishable pebbles (robots) residing on the vertices of an $n$-vertex connected graph with $p \le n$. A pebble may move from a vertex to an adjacent one in a time step provided that it…

Data Structures and Algorithms · Computer Science 2015-03-20 Jingjin Yu , Daniela Rus

Soft robots, inspired by elephant trunks or octopus arms, offer extraordinary flexibility to bend, twist, and elongate in ways that rigid robots cannot. However, their motion planning remains a challenge, especially in cluttered…

Robotics · Computer Science 2026-01-15 Carina Veil , Moritz Flaschel , Ellen Kuhl