Related papers: Evacuating Robots from a Disk Using Face-to-Face C…
A metamorphic robotic system (MRS) is composed of anonymous, memoryless, and autonomous modules that execute an identical distributed algorithm to move while keeping the connectivity of the modules. For an MRS, the number of modules…
Collision avoidance is one of the most important topics in the robotics field. The goal is to move the robots from initial locations to target locations such that they follow shortest non-colliding paths in the shortest time and with the…
The study of human-robot interaction (HRI) has received increasing research attention for robot navigation in pedestrian crowds. In this paper, we present empirical study of pedestrian-robot interaction in an uni-directional exit corridor.…
This paper presents a convex approach to the optimization of a cooperative rendezvous, that is, the problem of two distant spacecraft that simultaneously operate to get closer. Convex programming guarantees convergence towards the optimal…
This paper presents planning algorithms for a robotic manipulator with a fixed base in order to grasp a target object in cluttered environments. We consider a configuration of objects in a confined space with a high density so no…
We present a general decentralized formulation for a large class of collision avoidance methods and show that all collision avoidance methods of this form are guaranteed to be collision free. This class includes several existing algorithms…
We present three new approximation algorithms with improved constant ratios for selecting $n$ points in $n$ disks such that the minimum pairwise distance among the points is maximized. (1) A very simple $O(n\log n)$-time algorithm with…
The aim of the dispersion problem is to place a set of $k(\leq n)$ mobile robots in the nodes of an unknown graph consisting of $n$ nodes such that in the final configuration each node contains at most one robot, starting from any arbitrary…
We present a motion planner for planning through space-time with dynamic obstacles, velocity constraints, and unknown arrival time. Our algorithm, Space-Time RRT* (ST-RRT*), is a probabilistically complete, bidirectional motion planning…
Coordinating the motion of multiple robots in cluttered environments remains a computationally challenging task. We study the problem of minimizing the execution time of a set of geometric paths by a team of robots with state-dependent…
The security issue of mobile robots has attracted considerable attention in recent years. In this paper, we propose an intelligent physical attack to trap mobile robots into a preset position by learning the obstacle-avoidance mechanism…
In this work, we provide faster algorithms for approximating the optimal transport distance, e.g. earth mover's distance, between two discrete probability distributions $\mu, \nu \in \Delta^n$. Given a cost function $C : [n] \times [n] \to…
We study the problem of deploying a fleet of mobile robots to service tasks that arrive stochastically over time and at random locations in an environment. This is known as the Dynamic Vehicle Routing Problem (DVRP) and requires robots to…
We present the algorithmic procedure determining the impulsive behavior of a rigid disk having a single or possibly multiple frictionless impact with two walls forming a corner. The algorithmic procedure represents an application of the…
We study the problem of determining coordinated motions, of minimum total length, for two arbitrary convex centrally-symmetric (CCS) robots in an otherwise obstacle-free plane. Using the total path length traced by the two robot centres as…
High dynamic jump motions are challenging tasks for humanoid robots to achieve environment adaptation and obstacle crossing. The trajectory optimization is a practical method to achieve high-dynamic and explosive jumping. This paper…
This paper presents a computationally efficient optimization algorithm for solving nonconvex optimal control problems that involve discrete logic constraints. Traditional solution methods for these constraints require binary variables and…
This paper aims to solve the coordination of a team of robots traversing a route in the presence of adversaries with random positions. Our goal is to minimize the overall cost of the team, which is determined by (i) the accumulated risk…
Assume that a target is known to be present at an unknown point among a finite set of locations in the plane. We search for it using a mobile robot that has imperfect sensing capabilities. It takes time for the robot to move between…
Fast robotics pick-and-place with suction cups is a crucial component in the current development of automation in logistics (factory lines, e-commerce, etc.). By "critically fast" we mean the fastest possible movement for transporting an…