304 research outputs found
Adaptive and learning-based formation control of swarm robots
Autonomous aerial and wheeled mobile robots play a major role in tasks such as search and rescue, transportation, monitoring, and inspection. However, these operations are faced with a few open challenges including robust autonomy, and adaptive coordination based on the environment and operating conditions, particularly in swarm robots with limited communication and perception capabilities. Furthermore, the computational complexity increases exponentially with the number of robots in the swarm. This thesis examines two different aspects of the formation control problem. On the one hand, we investigate how formation could be performed by swarm robots with limited communication and perception (e.g., Crazyflie nano quadrotor). On the other hand, we explore human-swarm interaction (HSI) and different shared-control mechanisms between human and swarm robots (e.g., BristleBot) for artistic creation. In particular, we combine bio-inspired (i.e., flocking, foraging) techniques with learning-based control strategies (using artificial neural networks) for adaptive control of multi- robots. We first review how learning-based control and networked dynamical systems can be used to assign distributed and decentralized policies to individual robots such that the desired formation emerges from their collective behavior. We proceed by presenting a novel flocking control for UAV swarm using deep reinforcement learning. We formulate the flocking formation problem as a partially observable Markov decision process (POMDP), and consider a leader-follower configuration, where consensus among all UAVs is used to train a shared control policy, and each UAV performs actions based on the local information it collects. In addition, to avoid collision among UAVs and guarantee flocking and navigation, a reward function is added with the global flocking maintenance, mutual reward, and a collision penalty. We adapt deep deterministic policy gradient (DDPG) with centralized training and decentralized execution to obtain the flocking control policy using actor-critic networks and a global state space matrix. In the context of swarm robotics in arts, we investigate how the formation paradigm can serve as an interaction modality for artists to aesthetically utilize swarms. In particular, we explore particle swarm optimization (PSO) and random walk to control the communication between a team of robots with swarming behavior for musical creation
On the role and opportunities in teamwork design for advanced multi-robot search systems
Intelligent robotic systems are becoming ever more present in our lives across a multitude of domains such as industry, transportation, agriculture, security, healthcare and even education. Such systems enable humans to focus on the interesting and sophisticated tasks while robots accomplish tasks that are either too tedious, routine or potentially dangerous for humans to do. Recent advances in perception technologies and accompanying hardware, mainly attributed to rapid advancements in the deep-learning ecosystem, enable the deployment of robotic systems equipped with onboard sensors as well as the computational power to perform autonomous reasoning and decision making online. While there has been significant progress in expanding the capabilities of single and multi-robot systems during the last decades across a multitude of domains and applications, there are still many promising areas for research that can advance the state of cooperative searching systems that employ multiple robots. In this article, several prospective avenues of research in teamwork cooperation with considerable potential for advancement of multi-robot search systems will be visited and discussed. In previous works we have shown that multi-agent search tasks can greatly benefit from intelligent cooperation between team members and can achieve performance close to the theoretical optimum. The techniques applied can be used in a variety of domains including planning against adversarial opponents, control of forest fires and coordinating search-and-rescue missions. The state-of-the-art on methods of multi-robot search across several selected domains of application is explained, highlighting the pros and cons of each method, providing an up-to-date view on the current state of the domains and their future challenges
A Decentralized Architecture for Active Sensor Networks
This thesis is concerned with the Distributed Information Gathering (DIG) problem in which a Sensor Network is tasked with building a common representation of environment. The problem is motivated by the advantages offered by distributed autonomous sensing systems and the challenges they present. The focus of this study is on Macro Sensor Networks, characterized by platform mobility, heterogeneous teams, and long mission duration. The system under consideration may consist of an arbitrary number of mobile autonomous robots, stationary sensor platforms, and human operators, all linked in a network. This work describes a comprehensive framework called Active Sensor Network (ASN) which addresses the tasks of information fusion, decistion making, system configuration, and user interaction. The main design objectives are scalability with the number of robotic platforms, maximum flexibility in implementation and deployment, and robustness to component and communication failure. The framework is described from three complementary points of view: architecture, algorithms, and implementation. The main contribution of this thesis is the development of the ASN architecture. Its design follows three guiding principles: decentralization, modularity, and locality of interactions. These principles are applied to all aspects of the architecture and the framework in general. To achieve flexibility, the design approach emphasizes interactions between components rather than the definition of the components themselves. The architecture specifies a small set of interfaces sufficient to implement a wide range of information gathering systems. In the area of algorithms, this thesis builds on the earlier work on Decentralized Data Fusion (DDF) and its extension to information-theoretic decistion making. It presents the Bayesian Decentralized Data Fusion (BDDF) algorithm formulated for environment features represented by a general probability density function. Several specific representations are also considered: Gaussian, discrete, and the Certainty Grid map. Well known algorithms for these representations are shown to implement various aspects of the Bayesian framework. As part of the ASN implementation, a practical indoor sensor network has been developed and tested. Two series of experiments were conducted, utilizing two types of environment representation: 1) point features with Gaussian position uncertainty and 2) Certainty Grid maps. The network was operational for several days at a time, with individual platforms coming on and off-line. On several occasions, the network consisted of 39 software components. The lessons learned during the system's development may be applicable to other heterogeneous distributed systems with data-intensive algorithms
The Covering-Assignment Problem for Swarm-powered Ad-hoc Clouds: A Distributed 3D Mapping Use-case
The popularity of drones is rapidly increasing across the different sectors
of the economy. Aerial capabilities and relatively low costs make drones the
perfect solution to improve the efficiency of those operations that are
typically carried out by humans (e.g., building inspection, photo collection).
The potential of drone applications can be pushed even further when they are
operated in fleets and in a fully autonomous manner, acting de facto as a drone
swarm. Besides automating field operations, a drone swarm can serve as an
ad-hoc cloud infrastructure built on top of computing and storage resources
available across the swarm members and other connected elements. Even in the
absence of Internet connectivity, this cloud can serve the workloads generated
by the swarm members themselves, as well as by the field agents operating
within the area of interest. By considering the practical example of a
swarm-powered 3D reconstruction application, we present a new optimization
problem for the efficient generation and execution, on top of swarm-powered
ad-hoc cloud infrastructure, of multi-node computing workloads subject to data
geolocation and clustering constraints. The objective is the minimization of
the overall computing times, including both networking delays caused by the
inter-drone data transmission and computation delays. We prove that the problem
is NP-hard and present two combinatorial formulations to model it.
Computational results on the solution of the formulations show that one of them
can be used to solve, within the configured time-limit, more than 50% of the
considered real-world instances involving up to two hundred images and six
drones
Heuristics for optimizing 3D mapping missions over swarm-powered ad hoc clouds
Drones have been getting more and more popular in many economy sectors. Both
scientific and industrial communities aim at making the impact of drones even
more disruptive by empowering collaborative autonomous behaviors -- also known
as swarming behaviors -- within fleets of multiple drones. In swarming-powered
3D mapping missions, unmanned aerial vehicles typically collect the aerial
pictures of the target area whereas the 3D reconstruction process is performed
in a centralized manner. However, such approaches do not leverage computational
and storage resources from the swarm members.We address the optimization of a
swarm-powered distributed 3D mapping mission for a real-life humanitarian
emergency response application through the exploitation of a swarm-powered ad
hoc cloud. Producing the relevant 3D maps in a timely manner, even when the
cloud connectivity is not available, is crucial to increase the chances of
success of the operation. In this work, we present a mathematical programming
heuristic based on decomposition and a variable neighborhood search heuristic
to minimize the completion time of the 3D reconstruction process necessary in
such missions. Our computational results reveal that the proposed heuristics
either quickly reach optimality or improve the best known solutions for almost
all tested realistic instances comprising up to 1000 images and fifteen drones
Recommended from our members
Multi-Robot Coordination : Applications in Orchard Bin Management and Informative Path Planning
Efficient coordination is desired for multi-robot systems in many scenarios. In this research, we first provide a multi-robot system to help human workers during tree fruit harvest. We present an auction-based method to coordinate a team of self-propelled bin carriers to retrieve fruit bins. Second, we propose a more general information gathering problem in a dynamic environment. In this problem, locations of points of interest change over time. Further, the amount of meaningful information or reward that can be obtained from each point is limited. We propose to use a distributed sampling algorithm for task allocation, and a receding horizon strategy for path planning in this problem. To evaluate its performance, the proposed algorithm is compared to a baseline algorithm that implements sequential auction for task allocation with greedy path planning. Experimental results suggest that the proposed algorithm is more suitable for solving the aforementioned information gathering problem. Finally we present an effective approach to coordinating a team of UAVs (unmanned aerial vehicles) to simultaneous explore, map, and search in unknown environments. The UAVs can perform a weighted trade off between the three sub-tasks. Moreover, human operators can limit the time allowed for each UAV to remain without a valid communication link to the control base station. We compare results to a market-based baseline algorithm. Results suggest that our relay system improves the efficiency of exploring, mapping, and searching tasks
Robotic Wireless Sensor Networks
In this chapter, we present a literature survey of an emerging, cutting-edge,
and multi-disciplinary field of research at the intersection of Robotics and
Wireless Sensor Networks (WSN) which we refer to as Robotic Wireless Sensor
Networks (RWSN). We define a RWSN as an autonomous networked multi-robot system
that aims to achieve certain sensing goals while meeting and maintaining
certain communication performance requirements, through cooperative control,
learning and adaptation. While both of the component areas, i.e., Robotics and
WSN, are very well-known and well-explored, there exist a whole set of new
opportunities and research directions at the intersection of these two fields
which are relatively or even completely unexplored. One such example would be
the use of a set of robotic routers to set up a temporary communication path
between a sender and a receiver that uses the controlled mobility to the
advantage of packet routing. We find that there exist only a limited number of
articles to be directly categorized as RWSN related works whereas there exist a
range of articles in the robotics and the WSN literature that are also relevant
to this new field of research. To connect the dots, we first identify the core
problems and research trends related to RWSN such as connectivity,
localization, routing, and robust flow of information. Next, we classify the
existing research on RWSN as well as the relevant state-of-the-arts from
robotics and WSN community according to the problems and trends identified in
the first step. Lastly, we analyze what is missing in the existing literature,
and identify topics that require more research attention in the future
- …