6,714 research outputs found
Learning scalable and transferable multi-robot/machine sequential assignment planning via graph embedding
Can the success of reinforcement learning methods for simple combinatorial
optimization problems be extended to multi-robot sequential assignment
planning? In addition to the challenge of achieving near-optimal performance in
large problems, transferability to an unseen number of robots and tasks is
another key challenge for real-world applications. In this paper, we suggest a
method that achieves the first success in both challenges for robot/machine
scheduling problems.
Our method comprises of three components. First, we show a robot scheduling
problem can be expressed as a random probabilistic graphical model (PGM). We
develop a mean-field inference method for random PGM and use it for Q-function
inference. Second, we show that transferability can be achieved by carefully
designing two-step sequential encoding of problem state. Third, we resolve the
computational scalability issue of fitted Q-iteration by suggesting a heuristic
auction-based Q-iteration fitting method enabled by transferability we
achieved.
We apply our method to discrete-time, discrete space problems (Multi-Robot
Reward Collection (MRRC)) and scalably achieve 97% optimality with
transferability. This optimality is maintained under stochastic contexts. By
extending our method to continuous time, continuous space formulation, we claim
to be the first learning-based method with scalable performance among
multi-machine scheduling problems; our method scalability achieves comparable
performance to popular metaheuristics in Identical parallel machine scheduling
(IPMS) problems
Robust Environmental Mapping by Mobile Sensor Networks
Constructing a spatial map of environmental parameters is a crucial step to
preventing hazardous chemical leakages, forest fires, or while estimating a
spatially distributed physical quantities such as terrain elevation. Although
prior methods can do such mapping tasks efficiently via dispatching a group of
autonomous agents, they are unable to ensure satisfactory convergence to the
underlying ground truth distribution in a decentralized manner when any of the
agents fail. Since the types of agents utilized to perform such mapping are
typically inexpensive and prone to failure, this results in poor overall
mapping performance in real-world applications, which can in certain cases
endanger human safety. This paper presents a Bayesian approach for robust
spatial mapping of environmental parameters by deploying a group of mobile
robots capable of ad-hoc communication equipped with short-range sensors in the
presence of hardware failures. Our approach first utilizes a variant of the
Voronoi diagram to partition the region to be mapped into disjoint regions that
are each associated with at least one robot. These robots are then deployed in
a decentralized manner to maximize the likelihood that at least one robot
detects every target in their associated region despite a non-zero probability
of failure. A suite of simulation results is presented to demonstrate the
effectiveness and robustness of the proposed method when compared to existing
techniques.Comment: accepted to icra 201
Decentralized MPC based Obstacle Avoidance for Multi-Robot Target Tracking Scenarios
In this work, we consider the problem of decentralized multi-robot target
tracking and obstacle avoidance in dynamic environments. Each robot executes a
local motion planning algorithm which is based on model predictive control
(MPC). The planner is designed as a quadratic program, subject to constraints
on robot dynamics and obstacle avoidance. Repulsive potential field functions
are employed to avoid obstacles. The novelty of our approach lies in embedding
these non-linear potential field functions as constraints within a convex
optimization framework. Our method convexifies non-convex constraints and
dependencies, by replacing them as pre-computed external input forces in robot
dynamics. The proposed algorithm additionally incorporates different methods to
avoid field local minima problems associated with using potential field
functions in planning. The motion planner does not enforce predefined
trajectories or any formation geometry on the robots and is a comprehensive
solution for cooperative obstacle avoidance in the context of multi-robot
target tracking. We perform simulation studies in different environmental
scenarios to showcase the convergence and efficacy of the proposed algorithm.
Video of simulation studies: \url{https://youtu.be/umkdm82Tt0M
- …