中文
相关论文

相关论文: Safe Bubble Cover for Motion Planning on Distance …

200 篇论文

Formation flight of unmanned aerial vehicles (UAVs) poses significant challenges in terms of safety and formation keeping, particularly in cluttered environments. However, existing methods often struggle to simultaneously satisfy these two…

机器人学 · 计算机科学 2024-07-25 Qingzhao Liu , Bailing Tian , Xuewei Zhang , Junjie Lu , Zhiyu Li

Safe robot navigation is a fundamental research field for autonomous robots including ground mobile robots and flying robots. The primary objective of a safe robot navigation algorithm is to guide an autonomous robot from its initial…

机器人学 · 计算机科学 2017-09-05 Hang Li

This paper develops an algorithm that guides a multi-robot system in an unknown environment in search of fixed targets. The area to be scanned contains an unknown number of convex obstacles of unknown size and shape. The algorithm covers…

机器人学 · 计算机科学 2012-02-13 Jonathan Rogge , Dirk Aeyels

For a nonlinear stochastic path planning problem, sampling-based algorithms generate thousands of random sample trajectories to find the optimal path while guaranteeing safety by Lagrangian penalty methods. However, the sampling-based…

系统与控制 · 电气工程与系统科学 2021-11-16 Chuyuan Tao , Hunmin Kim , Hyungjin Yoon , Naira Hovakimyan , Petros Voulgaris

Existing methods for avoiding dynamic engagement zones (EZs) and minimizing risk leverage the calculus of variations to obtain optimal paths. While such methods are deterministic, they scale poorly as the number of engagement zones…

Many computations in robotics can be dramatically accelerated if the robot configuration space is described as a collection of simple sets. For example, recently developed motion planners rely on a convex decomposition of the free space to…

机器人学 · 计算机科学 2024-02-28 Peter Werner , Alexandre Amice , Tobia Marcucci , Daniela Rus , Russ Tedrake

Sampling-based motion-planning algorithms typically rely on nearest-neighbor (NN) queries when constructing a roadmap. Recent results suggest that in various settings NN queries may be the computational bottleneck of such algorithms.…

机器人学 · 计算机科学 2014-09-30 Michal Kleinbort , Oren Salzman , Dan Halperin

This paper extends the gap-based navigation technique in Potential Gap by guaranteeing safety for nonholonomic robots for all tiers of the local planner hierarchy, so called Safer Gap. The first tier generates a Bezier-based collision-free…

机器人学 · 计算机科学 2023-03-16 Shiyu Feng , Ahmad Abuaish , Patricio A. Vela

We propose a hybrid feedback control law that guarantees both safety and asymptotic stability for a class of Lagrangian systems in environments with obstacles. Rather than performing trajectory planning and implementing a…

最优化与控制 · 数学 2021-02-12 Fernando S. Barbosa , Lars Lindemann , Dimos V. Dimarogonas , Jana Tumova

In this paper, we propose a computationally efficient quadratic programming (QP) approach for generating smooth, $C^1$ continuous paths for mobile robots using piece-wise quadratic Bezier (PWB) curves. Our method explicitly incorporates…

机器人学 · 计算机科学 2025-10-30 Iancu Andrei , Marius Kloetzer , Cristian Mahulea , Catalin Dosoftei

The collision avoidance constraints are prominent as non-convex, non-differentiable, and challenging when defined in optimization-based motion planning problems. To overcome these issues, this paper presents a novel non-conservative…

机器人学 · 计算机科学 2024-04-16 Siavash Tavana , Sepideh Faghihi , Anton de Ruiter , Krishna Dev Kumar

Balancing safety and efficiency when planning in crowded scenarios with uncertain dynamics is challenging where it is imperative to accomplish the robot's mission without incurring any safety violations. Typically, chance constraints are…

机器人学 · 计算机科学 2023-02-22 Khaled A. Mustafa , Oscar de Groot , Xinwei Wang , Jens Kober , Javier Alonso-Mora

Rapid sampling from the environment to acquire available frontier points and timely incorporating them into subsequent planning to reduce fragmented regions are critical to improve the efficiency of autonomous exploration. We propose HPHS,…

机器人学 · 计算机科学 2024-07-22 Shijun Long , Ying Li , Chenming Wu , Bin Xu , Wei Fan

The deployment of robotic systems in real world environments requires the ability to quickly produce paths through cluttered, non-convex spaces. These planned trajectories must be both kinematically feasible (i.e., collision free) and…

机器人学 · 计算机科学 2024-11-21 Noel Csomay-Shanklin , William D. Compton , Aaron D. Ames

Autonomous mobile robots offer promising solutions for labor shortages and increased operational efficiency. However, navigating safely and effectively in dynamic environments, particularly crowded areas, remains challenging. This paper…

机器人学 · 计算机科学 2026-02-12 Sena Saito , Kenta Tabata , Renato Miyagusuku , Koichi Ozaki

Navigation safety is critical for many autonomous systems such as self-driving vehicles in an urban environment. It requires an explicit consideration of boundary constraints that describe the borders of any infeasible, non-navigable, or…

机器人学 · 计算机科学 2024-03-25 Junhong Xu , Kai Yin , Jason M. Gregory , Kris Hauser , Lantao Liu

Multi-mobile robot systems show great advantages over one single robot in many applications. However, the robots are required to form desired task-specified formations, making feasible motions decrease significantly. Thus, it is challenging…

机器人学 · 计算机科学 2022-10-10 Wenhang Liu , Jiawei Hu , Heng Zhang , Michael Yu Wang , Zhenhua Xiong

Accurate perception, state estimation and mapping are essential for safe robotic navigation as planners and controllers rely on these components for safety-critical decisions. However, existing mapping approaches often assume perfect pose…

Navigating rigid body objects through crowded environments can be challenging, especially when narrow passages are presented. Existing sampling-based planners and optimization-based methods like mixed integer linear programming (MILP)…

机器人学 · 计算机科学 2024-09-19 Mingxin Yu , Chuchu Fan

Planning in environments with other agents whose future actions are uncertain often requires compromise between safety and performance. Here our goal is to design efficient planning algorithms with guaranteed bounds on the probability of…

机器人学 · 计算机科学 2021-06-18 Hung-Jui Huang , Kai-Chi Huang , Michal Čáp , Yibiao Zhao , Ying Nian Wu , Chris L. Baker