English
Related papers

Related papers: Efficient Algorithms for Optimal Perimeter Guardin…

200 papers

In this paper, we consider the problem of generating inspection paths for robots. These paths should allow an attached measurement device to perform high-quality measurements. We formally show that generating robot paths, while maximizing…

Robotics · Computer Science 2019-05-15 Boris Bogaerts , Seppe Sels , Steve Vanlanduit , Rudi Penne

This paper studies the problem of multi-robot pursuit of how to coordinate a group of defending robots to capture a faster attacker before it enters a protected area. Such operation for defending robots is challenging due to the unknown…

Robotics · Computer Science 2024-11-01 Jinyong Chen , Rui Zhou , Zhaozong Wang , Yunjie Zhang , Guibin Sun

Sensor placement optimization methods have been studied extensively. They can be applied to a wide range of applications, including surveillance of known environments, optimal locations for 5G towers, and placement of missile defense…

Machine Learning · Computer Science 2024-05-22 Lukas Taus , Yen-Hsi Richard Tsai

While deep reinforcement learning techniques have recently produced considerable achievements on many decision-making problems, their use in robotics has largely been limited to simulated worlds or restricted motions, since unconstrained…

Robotics · Computer Science 2018-02-26 Tu-Hoa Pham , Giovanni De Magistris , Ryuki Tachibana

The problem of determining the configuration of points from partial distance information, known as the Euclidean Distance Geometry (EDG) problem, is fundamental to many tasks in the applied sciences. In this paper, we propose two algorithms…

Optimization and Control · Mathematics 2024-10-10 Chandler Smith , HanQin Cai , Abiy Tasissa

We study a problem of multi-agent exploration with behaviorally heterogeneous robots. Each robot maps its surroundings using SLAM and identifies a set of areas of interest (AoIs) or frontiers that are the most informative to explore next.…

Robotics · Computer Science 2025-09-11 Nirabhra Mandal , Aamodh Suresh , Carlos Nieto-Granda , Sonia Martínez

We consider the problem of planning a collision-free path of a robot in the presence of risk zones. The robot is allowed to travel in these zones but is penalized in a super-linear fashion for consecutive accumulative time spent there. We…

Computational Geometry · Computer Science 2017-03-10 Oren Salzman , Siddhartha Srinivasa

This paper presents a distributed algorithm for controlling the deployment of a team of mobile agents in formations whose shapes can be characterized by a broad class of polygons, including regular ones, where each agent occupies a corner…

Systems and Control · Computer Science 2017-03-24 Hector Garcia de Marina , Bayu Jayawardhana , Ming Cao

We investigate the problem of multi-robot coordinated planning in environments where the robots may have to operate in close proximity to each other. We seek computationally efficient planners that ensure safe paths and adherence to…

Multiagent Systems · Computer Science 2019-10-09 Clayton Mangette , Pratap Tokekar

We design a distributed feedback optimization strategy, embedded into a modular ROS 2 control architecture, which allows a team of heterogeneous robots to cooperatively monitor and encircle a target while patrolling points of interest.…

Robotics · Computer Science 2024-10-01 Lorenzo Pichierri , Guido Carnevale , Lorenzo Sforni , Giuseppe Notarstefano

In a world designed for legs, quadrupeds, bipeds, and humanoids have the opportunity to impact emerging robotics applications from logistics, to agriculture, to home assistance. The goal of this survey is to cover the recent progress toward…

Robotics · Computer Science 2022-11-22 Patrick M. Wensing , Michael Posa , Yue Hu , Adrien Escande , Nicolas Mansard , Andrea Del Prete

Given a simple polygon $\cal P$, in the Art Gallery problem the goal is to find the minimum number of guards needed to cover the entire $\cal P$, where a guard is a point and can see another point $q$ when $\overline{pq}$ does not cross the…

Computational Geometry · Computer Science 2021-12-03 Arash Vaezi , Mohammad Ghodsi

We deal with the problem of planning collision-free trajectories for robots operating in a shared space. Given the start and destination position for each of the robots, the task is to find trajectories for all robots that reach their…

Robotics · Computer Science 2016-08-10 Michal Čáp , Peter Novák , Alexander Kleiner

We study a new search problem on the plane involving a robot and an immobile treasure, initially placed at distance $1$ from each other. The length $\beta$ of an arc (a fence) within the perimeter of the corresponding circle, as well as the…

Computational Geometry · Computer Science 2016-06-28 Konstantinos Georgiou , Evangelos Kranakis , Alexandra Steau

Generating motions for robots interacting with objects of various shapes is a complex challenge, further complicated by the robot geometry and multiple desired behaviors. While current robot programming tools (such as inverse kinematics,…

Robotics · Computer Science 2025-06-19 Xuemin Chi , Hakan Girgin , Tobias Löw , Yangyang Xie , Teng Xue , Jihao Huang , Cheng Hu , Zhitao Liu , Sylvain Calinon

Robotic algorithms typically depend on various parameters, the choice of which significantly affects the robot's performance. While an initial guess for the parameters may be obtained from dynamic models of the robot, parameters are usually…

Robotics · Computer Science 2020-04-08 Felix Berkenkamp , Andreas Krause , Angela P. Schoellig

In this paper, we consider the automated planning of optimal paths for a robotic team satisfying a high level mission specification. Each robot in the team is modeled as a weighted transition system where the weights have associated…

Robotics · Computer Science 2015-03-13 Alphan Ulusoy , Stephen L. Smith , Calin Belta

In this work, we study the problem of dispersion of mobile robots on dynamic rings. The problem of dispersion of $n$ robots on an $n$ node graph, introduced by Augustine and Moses Jr. [1], requires robots to coordinate with each other and…

Distributed, Parallel, and Cluster Computing · Computer Science 2017-10-17 Ankush Agarwalla , John Augustine , William K. Moses , Madhav Sankar K. , Arvind Krishna Sridhar

A sliding camera inside an orthogonal polygon $P$ is a point guard that travels back and forth along an orthogonal line segment $\gamma$ in $P$. The sliding camera $g$ can see a point $p$ in $P$ if the perpendicular from $p$ onto $\gamma$…

Computational Geometry · Computer Science 2016-04-26 Therese Biedl , Timothy M. Chan , Stephanie Lee , Saeed Mehrabi , Fabrizio Montecchiani , Hamideh Vosoughpour

The use of autonomous robots for delivery of goods to customers is an exciting new way to provide a reliable and sustainable service. However, in the real world, autonomous robots still require human supervision for safety reasons. We…

Neural and Evolutionary Computing · Computer Science 2023-04-26 Peter J. Bentley , Soo Ling Lim , Paolo Arcaini , Fuyuki Ishikawa
‹ Prev 1 8 9 10 Next ›