English
Related papers

Related papers: Exploring Adversarial Obstacle Attacks in Search-b…

200 papers

Simulating hostile attacks of physical autonomous systems can be a useful tool to examine their robustness to attack and inform vulnerability-aware design. In this work, we examine this through the lens of multi-robot patrol, by presenting…

Robotics · Computer Science 2025-09-16 James C. Ward , Alex Bott , Connor York , Edmund R. Hunt

Trajectory Planning is a crucial word in Modern & Advanced Robotics. It's a way of generating a smooth and feasible path for the robot to follow over time. The process primarily takes several factors to generate the path, such as velocity,…

Robotics · Computer Science 2024-07-19 Arunabh Bora

Collision-free navigation in cluttered environments with static and dynamic obstacles is essential for many multi-robot tasks. Dynamic obstacles may also be interactive, i.e., their behavior varies based on the behavior of other entities.…

Robotics · Computer Science 2024-05-21 Baskın Şenbaşlar , Gaurav S. Sukhatme

Collision avoidance in unknown obstacle-cluttered environments may not always be feasible. This paper focuses on an emerging paradigm shift in which potential collisions with the environment can be harnessed instead of being avoided…

Robotics · Computer Science 2020-09-07 Zhouyu Lu , Zhichao Liu , Gustavo J. Correa , Konstantinos Karydis

This paper studies, for the first time, the trajectory planning problem in adversarial environments, where the objective is to design the trajectory of a robot to reach a desired final state despite the unknown and arbitrary action of an…

Optimization and Control · Mathematics 2019-10-25 Yin-Chen Liu , Gianluca Bianchin , Fabio Pasqualetti

Safe and efficient path planning in parking scenarios presents a significant challenge due to the presence of cluttered environments filled with static and dynamic obstacles. To address this, we propose a novel and computationally efficient…

We consider systems that require timely monitoring of sources over a communication network, where the cost of delayed information is unknown, time-varying and possibly adversarial. For the single source monitoring problem, we design…

Networking and Internet Architecture · Computer Science 2021-05-31 Vishrant Tripathi , Eytan Modiano

Motion planning in the presence of multiple dynamic obstacles is an important research problem from the perspective of autonomous vehicles as well as space-constrained multi-robot work environment. In this paper, we address the motion…

Systems and Control · Electrical Eng. & Systems 2019-12-30 Trishant Roy , Anindya Harchowdhury , Leena Vachhani

If we give a robot the task of moving an object from its current position to another location in an unknown environment, the robot must explore the map, identify all types of obstacles, and then determine the best route to complete the…

Robotics · Computer Science 2022-08-22 Saeid Alirezazadeh , Luís A. Alexandre

The problem of planning a set of paths for the coalition of robots (agents) with different capabilities is considered in the paper. Some agents can modify the environment by destructing the obstacles thus allowing the other ones to shorten…

Artificial Intelligence · Computer Science 2018-07-03 Anton Andreychuk , Konstantin Yakovlev

This paper presents evolutionary methods for optimization in dynamic mobile robot path planning. In dynamic mobile path planning, the goal is to find an optimal feasible path from starting point to target point with various obstacles, as…

Robotics · Computer Science 2019-02-12 Masoud Fetanat , Sajjad Haghzad , Saeed Bagheri Shouraki

This paper proposes a solution to the problem of smooth path planning for mobile robots in dynamic and unknown environments. A novel concept of Time-Warped Grid is introduced to predict the pose of obstacles in the environment and avoid…

Robotics · Computer Science 2019-03-19 Siavash Farzan , Guilherme N. DeSouza

We propose and analyze a recipient-anonymous stochastic routing model to study a fundamental trade-off between anonymity and routing delay. An agent wants to quickly reach a goal vertex in a network through a sequence of routing actions,…

Computer Science and Game Theory · Computer Science 2021-01-01 Mine Su Erturk , Kuang Xu

We study the navigation problem for a robot moving amidst static and dynamic obstacles and rely on a hierarchical approach to solve it. First, the reference trajectory is planned by the safe interval path planning algorithm that is capable…

Robotics · Computer Science 2019-06-18 Konstantin Yakovlev , Anton Andreychuk , Juliya Belinskaya , Dmitry Makarov

Safety is a critical concern for urban flights of autonomous Unmanned Aerial Vehicles. In populated environments, risk should be accounted for to produce an effective and safe path, known as risk-aware path planning. Risk-aware path…

Robotics · Computer Science 2024-09-19 Jun Xiang , Junfei Xie , Jun Chen

In this work, we introduce a new graph search algorithm, lazy edged based A* (LEA*), for robot motion planning. By using an edge queue and exploiting the idea of lazy search, LEA* is optimally vertex efficient similar to A*, and has…

Robotics · Computer Science 2023-09-20 Dongliang Zheng , Panagiotis Tsiotras

Autonomous navigation in dynamic environment heavily depends on the environment and its topology. Prior knowledge of the environment is not usually accurate as the environment keeps evolving in time. Since robot is continuously evaluating…

Robotics · Computer Science 2020-07-21 Xihan Ma , Honglin Sun , Enwei Xu , Song Cui , Boqun Yin , Mariam Faied

As a core part of autonomous driving systems, motion planning has received extensive attention from academia and industry. However, real-time trajectory planning capable of spatial-temporal joint optimization is challenged by nonholonomic…

Robotics · Computer Science 2023-04-11 Zhichao Han , Yuwei Wu , Tong Li , Lu Zhang , Liuao Pei , Long Xu , Chengyang Li , Changjia Ma , Chao Xu , Shaojie Shen , Fei Gao

Path planning in the presence of dynamic obstacles is a challenging problem due to the added time dimension in search space. In approaches that ignore the time dimension and treat dynamic obstacles as static, frequent re-planning is…

Robotics · Computer Science 2016-05-24 Anirudh Vemula , Katharina Muelling , Jean Oh

In recent years, advancements have been made towards the goal of using chaotic coverage path planners for autonomous search and traversal of spaces with limited environmental cues. However, the state of this field is still in its infancy as…