Cost Adaptation for Robust Decentralized Swarm Behaviour

Decentralized receding horizon control (D-RHC) provides a mechanism for coordination in multi-agent settings without a centralized command center. However, combining a set of different goals, costs, and constraints to form an efficient optimization objective for D-RHC can be difficult. To allay this problem, we use a meta-learning process -- cost adaptation -- which generates the optimization objective for D-RHC to solve based on a set of human-generated priors (cost and constraint functions) and an auxiliary heuristic. We use this adaptive D-RHC method for control of mesh-networked swarm agents. This formulation allows a wide range of tasks to be encoded and can account for network delays, heterogeneous capabilities, and increasingly large swarms through the adaptation mechanism. We leverage the Unity3D game engine to build a simulator capable of introducing artificial networking failures and delays in the swarm. Using the simulator we validate our method on an example coordinated exploration task. We demonstrate that cost adaptation allows for more efficient and safer task completion under varying environment conditions and increasingly large swarm sizes. We release our simulator and code to the community for future work.Comment: Accepted to IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS), 201

Distributed and Centralized Task Allocation: When and Where to Use Them

Self-organisation is frequently advocated as the solution for managing large, dynamic systems. Distributed algorithms are implicitly designed for infinitely large problems, while small systems are regarded as being controllable using traditional, centralised approaches. Many real-world systems, however, do not fit conveniently into these "small" or "large" categories, resulting in a range of cases where the optimal solution is ambiguous. This difficulty is exacerbated by enthusiasts of either approach constructing problems that suit their preferred control architecture. We address this ambiguity by building an abstract model of task allocation in a community of specialised agents. We are inspired by the problem of work distribution in distributed satellite systems, but the model is also relevant to the resource allocation problems in distributed robotics, autonomic computing and wireless sensor networks. We compare the behaviour of a self-organising, market-based task allocation strategy to a classical approach that uses a central controller with global knowledge. The objective is not to prove one mechanism inherently superior to the other; instead we are interested in the regions of problem space where each of them dominates. Simulation is used to explore the trade-off between energy consumption and robustness in a system of intermediate size, with fixed communication costs and varying rates of component failure. We identify boundaries between regions in the parameter space where one or the other architecture will be favoured. This allows us to derive guidelines for system designers, thus contributing to the development of a disciplined approach to controlling distributed systems using self-organising mechanisms

An auction-based approach with closed-loop bid adjustment to dynamic task allocation in robot teams

Dynamic task allocation is among the most difficult issues in multi-robot coordination, although it is imperative for a multitude of applications. Auction-based approaches are popular methods that allocate tasks to robots by assembling team information at a single location to make practicable decisions. However, a main deficiency of auction-based methods is that robots generally do not have sufficient information to estimate reliable bids to perform tasks, particularly in dynamic environments. While some techniques have been developed to improve bidding, they are mostly open-looped without feed-back adjustments to tune the bid prices for subsequent tasks of the same type. Robots' bids, if not assessed and adjusted accordingly, may not be trustworthy and would indeed impede team performance. To address this issue, we propose a closed-loop bid adjustment mechanism for auction-based multi-robot task allocation, with an aim to evaluate and improve robots' bids, and hence enhance the overall team performance. Each robot in a team maintains and uses its own track record as closed-loop feedback information to adjust and improve its bid prices. After a robot has completed a task, it assesses and records its performance to reflect the discrepancy between the bid price and the actual cost of the task. Such performance records, with time-discounting factors, are taken into account to damp out fluctuations of bid prices. Adopting this adjustment mechanism, a task would be more likely allocated to a competent robot that submits a more accurate bid price, and hence improve the overall team performance. Simulation of task allocation of free-range automated guided vehicles serving at a container terminal is presented to demonstrate the effectiveness of the adjustment mechanism.postprintThe World Congress on Engineering (WCE 2011), London, U.K., 6-8 July 2011. In Proceedings of WCE, 2011, v. 2, p. 1061-106

Lazy auctions for multi-robot collision avoidance and motion control under uncertainty

We present an auction-flavored multi-robot planning mechanism where coordination is to be achieved on the occupation of atomic resources modeled as binary inter-robot constraints. Introducing virtual obstacles, we show how this approach can be combined with particlebased obstacle avoidance methods, offering a decentralized, auction-based alternative to previously established centralized approaches for multirobot open-loop control. We illustrate the effectiveness of our new approach by presenting simulations of typical spatially-continuous multirobot path-planning problems and derive bounds on the collision probability in the presence of uncertainty

Performance optimisation of mobile robots in dynamic environments

This paper presents a robotic simulation system, that combines task allocation and motion planning of multiple mobile robots, for performance optimisation in dynamic environments. While task allocation assigns jobs to robots, motion planning generates routes for robots to execute the assigned jobs. Task allocation and motion planning together play a pivotal role in optimisation of robot team performance. These two issues become more challenging when there are often operational uncertainties in dynamic environments. We address these issues by proposing an auction-based closed-loop module for task allocation and a bio-inspired intelligent module for motion planning to optimise robot team performance in dynamic environments. The task allocation module is characterised by a closed-loop bid adjustment mechanism to improve the bid accuracy even in light of stochastic disturbances. The motion planning module is bio-inspired intelligent in that it features detection of imminent neighbours and responsiveness of virtual force navigation in dynamic traffic conditions. Simulations show that the proposed system is a practical tool to optimise the operations by a team of robots in dynamic environments. © 2012 IEEE.published_or_final_versionThe IEEE International Conference on Virtual Environments Human-Computer Interfaces and Measurement Systems (VECIMS 2012), Tianjin, China, 2-4 July 2012. In Proceedings of IEEE VECIMS, 2012, p. 54-5

A Networking Framework for Multi-Robot Coordination

Autonomous robots operating in real environments need to be able to interact with a dynamic world populated with objects, people, and, in general, other agents. The current generation of autonomous robots, such as the ASIMO robot by Honda or the QRIO by Sony, has showed impressive performances in mechanics and control of movements; moreover, recent literature reports encouraging results about the capability of such robots of representing themselves with respect to a dynamic external world, of planning future actions and of evaluating resulting situations in order to make new plans. However, when multiple robots are supposed to operate together, coordination and communication issues arise; while noteworthy results have been achieved with respect to the control of a single robot, novel issues arise when the actions of a robot influence another''s behavior. The increase in computational power available to systems nowadays makes it feasible, and even convenient, to organize them into a single distributed computing environment in order to exploit the synergy among different entities. This is especially true for robot teams, where cooperation is supposed to be the most natural scheme of operation, especially when robots are required to operate in highly constrained scenarios, such as inhospitable sites, remote sites, or indoor environments where strict constraints on intrusiveness must be respected. In this case, computations will be inherently network-centric, and to solve the need for communication inside robot collectives, an efficient network infrastructure must be put into place; once a proper communication channel is established, multiple robots may benefit from the interaction with each other in order to achieve a common goal. The framework presented in this paper adopts a composite networking architecture, in which a hybrid wireless network, composed by commonly available WiFi devices, and the more recently developed wireless sensor networks, operates as a whole in order both to provide a communication backbone for the robots and to extract useful information from the environment. The ad-hoc WiFi backbone allows robots to exchange coordination information among themselves, while also carrying data measurements collected from surrounding environment, and useful for localization or mere data gathering purposes. The proposed framework is called RoboNet, and extends a previously developed robotic tour guide application (Chella et al., 2007) in the context of a multi-robot application; our system allows a team of robots to enhance their perceptive capabilities through coordination obtained via a hybrid communication network; moreover, the same infrastructure allows robots to exchange information so as to coordinate their actions in order to achieve a global common goal. The working scenario considered in this paper consists of a museum setting, where guided tours are to be automatically managed. The museum is arranged both chronologically and topographically, but the sequence of findings to be visited can be rearranged depending on user queries, making a sort of dynamic virtual labyrinth with various itineraries. Therefore, the robots are able to guide visitors both in prearranged tours and in interactive tours, built in itinere depending on the interaction with the visitor: robots are able to rebuild the virtual connection between findings and, consequently, the path to be followed. This paper is organized as follows. Section 2 contains some background on multi-robot coordination, and Section 3 describes the underlying ideas and the motivation behind the proposed architecture, whose details are presented in Sections 4, 5, and 6. A realistic application scenario is described in Section 7, and finally our conclusions are drawn in Section 8

What’s in it for me? Incentive-compatible route coordination of crowdsourced resources

With the recent trend in crowdsourcing, i.e., using the power of crowds to assist in satisfying demand, the pool of resources suitable for GeoPresence-capable systems has expanded to include already roaming devices, such as mobile phones, and moving vehicles. We envision an environment, in which the motion of these crowdsourced mobile resources is coordinated, according to their preexisting schedules to satisfy geo-temporal demand on a mobility field. In this paper, we propose an incentive compatible route coordination mechanism for crowdsourced resources, in which participating mobile agents satisfy geo-temporal requests in return for monetary rewards. We define the Flexible Route Coordination (FRC) problem, in which an agent’s flexibility is exploited to maximize the coverage of a mobility field, with an objective to maximize the revenue collected from satisfied paying requests. Given that the FRC problem is NP-hard, we define an optimal algorithm to plan the route of a single agent on a graph with evolving labels, then we use that algorithm to define a 1/2-approximation algorithm to solve the problem in its general model, with multiple agents. Moreover, we define an incentive compatible, rational, and cash-positive payment mechanism, which guarantees that an agent’s truthfulness about its flexibility is an ex-post Nash equilibrium strategy. Finally, we analyze the proposed mechanisms theoretically, and evaluate their performance experimentally using real mobility traces from urban environments.Supported in part by NSF Grants, #1430145, #1414119, #1347522, #1239021, and #1012798

Incentive-compatible route coordination of crowdsourced resources

Technical ReportWith the recent trend in crowdsourcing, i.e., using the power of crowds to assist in satisfying demand, the pool of resources suitable for GeoPresen-ce-capable systems has expanded to include already roaming devices, such as mobile phones, and moving vehicles. We envision an environment, in which the motion of these crowdsourced mobile resources is coordinated, according to their preexisting schedules to satisfy geo-temporal demand on a mobility field. In this paper, we propose an incentive compatible route coordination mechanism for crowdsourced resources, in which participating mobile agents satisfy geo-temporal requests in return for monetary rewards. We define the Flexible Route Coordination (FRC) problem, in which an agent’s flexibility is exploited to maximize the coverage of a mobility field, with an objective to maximize the revenue collected from satisfied paying requests. Given that the FRC problem is NP-hard, we define an optimal algorithm to plan the route of a single agent on a graph with evolving labels, then we use that algorithm to define a 1-approximation algorithm to solve the 2 problem in its general model, with multiple agents. Moreover, we define an incentive compatible, rational, and cash-positive payment mechanism, which guarantees that an agent’s truthfulness about its flexibility is an ex-post Nash equilibrium strategy. Finally, we analyze the proposed mechanisms theoretically, and evaluate their performance experimentally using real mobility traces from urban environments