Results 11 - 20
of
21
Dynamical Task Allocation and Reallocation Based on Body Expansion Behavior for Multi-robot Coordination
"... Abstract- The inefficiency, exponential amount of communication and computational time are high undesirable for realistic applications under utilizing the existing distributed task allocation approaches, especially for the dynamical tasks that move randomly before assigned robots to execute them, an ..."
Abstract
-
Cited by 1 (1 self)
- Add to MetaCart
(Show Context)
Abstract- The inefficiency, exponential amount of communication and computational time are high undesirable for realistic applications under utilizing the existing distributed task allocation approaches, especially for the dynamical tasks that move randomly before assigned robots to execute them, and the condition of these tasks could vary over time. For such dynamical task assignment problem, we propose a dynamical task allocation and reallocation method for multiple robots coordination system based on multi-round negotiation and body expansion behaviour. For the first time round negotiation, robots sequentially negotiate and select tasks to perform according the proposed algorithm, and declare the information to other robots. When all robots have finished first time selecting, then the remaining un-selection robots choose the rest un-assigned tasks again sequentially. We set two distance thresholds for decision making so as to implement body expansion behavior. Based on the body expansion behavior, one robot can request, accept and refuse other robots to execute tasks by intention communication under the order of two distance thresholds. The advantages of dynamical task allocation and reallocation approach is demonstrated by comparing with existing task allocation algorithm in this paper. The simulation results show that the efficiency for whole multi-robot coordination system to accomplish all tasks is improved by utilizing our approach. Moreover, it is more conducive to reduce the numerous computational time and communication compare to the existing investigated task assignment methods. Index Terms- Multiple autonomous mobile robot. Task
Forming Long Term Teams to Exploit Synergies among Heterogeneous Agents
, 2012
"... In this work, we describe how agents can take advantage of synergies among each other and increase their efficiency at accomplishing tasks by working in teams. We present different team structures for heterogeneous agents, which range from static teams that are formed upfront and never change, to dy ..."
Abstract
-
Cited by 1 (0 self)
- Add to MetaCart
(Show Context)
In this work, we describe how agents can take advantage of synergies among each other and increase their efficiency at accomplishing tasks by working in teams. We present different team structures for heterogeneous agents, which range from static teams that are formed upfront and never change, to dynamic teams where agents can change teams as need arises, to teams that allow only some types of agents to be members. We also develop teaming strategies that are strongly domain specific for the RoboCup Rescue simulation environment. RoboCup Rescue is a simulated environment which is characterized by uncertainty in available information and by severely limited communications among agents. The tasks to be accomplished are saving civilians who are trapped in buildings and preventing fires from spreading in the city. The locations of civilians and fires are not known upfront and have to be discovered. The domain constraints limit the applicability of some popular team formation algorithms and require adap-tive strategies. We measure the effectiveness of the various teaming strategies we propose. Our experimental results support the hypothesis that teaming improves performance, and that more specialized and knowledge rich teaming arrangements perform better. 1
Articles I Have a Robot, and I’m Not Afraid to Use It!
"... n Robots (and roboticists) increasingly appear ..."
Dynamic Partnership Formation for Multi-Rover Coordination
"... Coordinating multiagent systems to maximize global information collection both presents scientific challenges and provides application opportunities, such as planetary exploration, and search and rescue. In particular, in many domains where communication is expensive because of limited power or com ..."
Abstract
- Add to MetaCart
(Show Context)
Coordinating multiagent systems to maximize global information collection both presents scientific challenges and provides application opportunities, such as planetary exploration, and search and rescue. In particular, in many domains where communication is expensive because of limited power or computation, the coordination must be achieved in a passive manner, without agents explicitly informing other agents of their states and/or intended actions. In this work, we extend results on such multiagent coordination algorithms to domains where the agents cannot achieve the required tasks without forming teams. We investigate team formation in three types of domains, one where n agents need to perform a task for the team to receive credit, one where there is an optimal number of agents (n) required for the task, but where the agents receive a decaying reward if they form a team with membership other than n, and finally we investigate heterogeneous teams where individuals vary in construction. Our results show that encouraging agents to coordinate is much more successful than strictly requiring coordination. We also show that using objective functions that are aligned with the global objective and locally computable significantly improve over agents using the global objective directly, and that the improvement significantly increases with complexity.
I Have a Robot, and I’m Not Afraid to Use It!
, 2012
"... Robots (and roboticists) increasingly appear ..."
Time-extended Multi-robot Coordination for Domains with Intra-path Constraints
"... Abstract — Many applications require teams of robots to cooperatively execute complex tasks. Among these domains are those where successful coordination solutions must respect constraints that occur on the intra-path level. This work focuses on multi-agent coordination for disaster response with int ..."
Abstract
- Add to MetaCart
(Show Context)
Abstract — Many applications require teams of robots to cooperatively execute complex tasks. Among these domains are those where successful coordination solutions must respect constraints that occur on the intra-path level. This work focuses on multi-agent coordination for disaster response with intra-path constraints, a compelling application that is not well addressed by current coordination methods. In this domain a group of fire trucks agents attempt to address a number of fires spread throughout a city in the wake of a large-scale disaster. The disaster has also caused many city roads to be blocked by impassable debris, which can be cleared by bulldozer robots. A high-quality coordination solution must determine not only a task allocation but also what routes the fire trucks should take given the intra-path precedence constraints and which bulldozers should be assigned to clear debris along those routes. This work presents two methods for generating time-extended coordination solutions – solutions where more than one task is assigned to each agent – for domains with intra-path constraints. While a number of approaches have employed time-extended coordination for domains with independent tasks, few approaches have used time-extended coordination in domains where agents’ schedules are interdependent at the path planning level. Our first approach uses tiered auctions and two heuristic techniques, clustering and opportunistic path planning, to perform a bounded search of possible time-extended schedules and allocations. Our second method uses a centralized, non-heuristic, genetic algorithm-based approach that provides higher quality solutions but at substantially greater computational cost. We compare our time-extended approaches with a range of single task allocation approaches in a simulated disaster response domain. I.
A STOCHASTIC QUEUEING MODEL FOR MULTI-ROBOT TASK ALLOCATION
"... Abstract: A central problem in multi-robot systems is to solve the multi-robot task allocation problem. In this paper, a decentralized stochastic model based on stochastic queueing processes is applied for an application of collec-tive detection of underground landmines where the robots are not told ..."
Abstract
- Add to MetaCart
(Show Context)
Abstract: A central problem in multi-robot systems is to solve the multi-robot task allocation problem. In this paper, a decentralized stochastic model based on stochastic queueing processes is applied for an application of collec-tive detection of underground landmines where the robots are not told the distribution or number of landmines to be encountered in the environment. Repeat demands of inspection in the environment to ensure the accu-racy of robot findings are necessary in this application. The proposed model is based on the estimation of a stochastic queue of pending demands that represents the alternatives of action for a robot and is used to nego-tiate possible conflicts with other robots. We compare and contrast this method with a decentralized greedy approach based on the distance towards the sites where inspection demands are required. Experimental results obtained using simulated robots in the Webots c © environment are presented. The performance of robots is measured in terms of two metrics, completion time and distance traveled for processing a demand. Robots applying the stochastic queueing model obtained competitive results. 1
Advances in Complex Systems c © World Scientific Publishing Company Dynamic Partnership Formation for Multi-Rover Coordination
, 2012
"... Coordinating multiagent systems to maximize global information collection is a key challenge in many real world applications such as planetary exploration, and search and rescue. In particular, in many domains where communication is expensive (e.g. in terms of energy), the coordination must be achie ..."
Abstract
- Add to MetaCart
(Show Context)
Coordinating multiagent systems to maximize global information collection is a key challenge in many real world applications such as planetary exploration, and search and rescue. In particular, in many domains where communication is expensive (e.g. in terms of energy), the coordination must be achieved in a passive manner, without agents explicitly informing other agents of their states and/or intended actions. In this work, we extend results on such multiagent coordination algorithms to domains where the agents cannot achieve the required tasks without forming teams. We investigate team formation in three types of domains, one where n agents need to perform a task for the team to receive credit, one where there is an optimal number of agents (n) required for the task, but where the agents receive a decaying reward if they form a team with membership other than n, and finally we investigate heterogeneous teams where individuals vary in construction. Our results show that encouraging agents to coordinate is more successful than strictly requiring coordination. We also show that devising agent objective functions that are aligned with the global objective and locally computable significantly outperform systems where agents directly use the global objective, and that the improvement increases with the complexity of the task. 1.
Robot Coordination for Energy-balanced Matching and Sequence Dispatch of Robots to Events
"... Abstract—Given a set of events and a set of robots, the dispatch problem is to allocate one robot for each event to visit it. In a single round, each robot may be allowed to visit only one event (matching dispatch), or several events in a sequence (sequence dispatch). In a distributed setting, each ..."
Abstract
- Add to MetaCart
(Show Context)
Abstract—Given a set of events and a set of robots, the dispatch problem is to allocate one robot for each event to visit it. In a single round, each robot may be allowed to visit only one event (matching dispatch), or several events in a sequence (sequence dispatch). In a distributed setting, each event is discovered by a sensor and reported to a robot. Here, we present novel algorithms aimed at overcoming the shortcomings of several existing solutions. We propose pairwise distance based matching algorithm PDM to eliminate long edges by pairwise exchanges between matching pairs. Our sequence dispatch algorithm SQD iteratively finds the closest event-robot pair, includes the event in dispatch schedule of the selected robot and updates its position accordingly. When event-robot distances are multiplied by robot resistance (inverse of the remaining energy), the corresponding energy-balanced variants are obtained. We also present generalizations which handle multiple visits and timing constraints. Our localized algorithm MAD is based on information mesh infrastructure and local auctions within the robot network for obtaining the optimal dispatch schedule for each robot. The simulations conducted confirm the advantages of our algorithms over other existing solutions in terms of average robot-event distance and lifetime. Index Terms—robot coordination; wireless sensor networks; matching; sequence dispatch; centralized and distributed algorithm; energy efficiency F 1