6,443 Hits in 4.4 sec

On Scaling Multi-Agent Task Reallocation Using Market-Based Approach

Rajesh K. Karmani, Timo Latvala, Gul Agha
2007 First International Conference on Self-Adaptive and Self-Organizing Systems (SASO 2007)  
We propose a novel market-based approach, called Market-based Approach with Look-ahead Agents (MALA), to address the problem. In MALA, agents use look ahead to optimize their behavior.  ...  The agent then uses the preferred tour to evaluate potential trades with other agents in linear time -a necessary prerequisite for scalability of market-based approach.  ...  Acknowledgements We would like to thank Chandra Chekuri for suggesting the use of the Universal TSP algorithm and for providing useful insights into alternative approaches for planning tours.  ... 
doi:10.1109/saso.2007.41 dblp:conf/saso/KarmaniLA07 fatcat:jlvwzz4q6vg75f5t6sob733xai

A comparative study of dynamical sequential and global optimal task reallocation methodology for distributed multi-robot system

Guanghui Li, Y. Tamura, H. Asama
2011 2011 8th International Conference on Ubiquitous Robots and Ambient Intelligence (URAI)  
For such new domain, we propose two methods, one is called dynamical sequential task allocation and reallocation, and another is global optimal task allocation and reallocation, for the distributed multi-robot  ...  The former approach implements multi-round negotiation and body expansion behavior for mobile tasks selection.  ...  The dynamic sequential method is based on multi-round negotiation and body expansion behavior. Global optimal approach is extended from combinatorial optimization and market-based task allocation.  ... 
doi:10.1109/urai.2011.6145982 dblp:conf/urai/LiTA11 fatcat:ulgz23ythvdvjb2toymlcx5lca

Market-based coordination strategies for physical multi-agent systems

MyungJoo Ham, Gul Agha
2008 ACM SIGBED Review  
Market-based mechanisms for real-time dynamic coordinated task assignment of physical multi-agent systems are studied.  ...  We provide a small scale validation for work with software simulations.  ...  Because of the dynamic and asynchronous environment, dynamic reallocation may improve the performance. Robots may swap tasks after their auctions. Experiments 6 robots and 9 targets are used.  ... 
doi:10.1145/1366283.1366306 fatcat:mxoxg7n6oje5fduzzbfztnonv4

A Location-Aware Strategy for Agents Negotiating Load-Balancing

Quentin Baert, Anne Cecile Caron, Maxime Morge, Jean-Christophe Routier, Kostas Stathis
2019 2019 IEEE 31st International Conference on Tools with Artificial Intelligence (ICTAI)  
The strategy allows agents to identify opportunities within a current unbalanced allocation, which in turn triggers concurrent and one-tomany negotiations amongst agents to locally reallocate some tasks  ...  We evaluate the strategy in a multi-agent deployment of the MapReduce design pattern for processing large datasets.  ...  Most of the existing works adopting the market-based approach (e.g.  ... 
doi:10.1109/ictai.2019.00098 dblp:conf/ictai/BaertCMRS19 fatcat:lernw6xegjhslamsb6ojqrrrpe

Performance Optimization for Multi-agent Based Simulation in Grid Environments

Dawit Mengistu, Peter Tr
2008 2008 Eighth IEEE International Symposium on Cluster Computing and the Grid (CCGRID)  
Multi-agent based simulation (MABS) is a discrete event simulation technique used to study complex systems with entities having social and autonomous behavior.  ...  In this paper, we propose an adaptation strategy to support efficient execution of large-scale MABS applications on typical Grid infrastructures.  ...  Transportation Scenario We plan to use the "Java Agent DEvelopment Framework" (JADE) toolkit as our MABS platform, a widely used multi agent platform based on FIPA specifications.  ... 
doi:10.1109/ccgrid.2008.114 dblp:conf/ccgrid/MengistuT08 fatcat:a2eyr7dw7zhovcse4p3mtjqa2i

A distributed multi-agent production planning and scheduling framework for mobile robots

Stefano Giordani, Marin Lujak, Francesco Martinelli
2013 Computers & industrial engineering  
An iterative auction based negotiation protocol is used at the first level while the second level solves a Multi-Robot Task Allocation (MRTA) problem through a distributed version of the Hungarian Method  ...  ); at the second, scheduling level, agents are robots which reallocate themselves among different tasks to satisfy the requests coming from the first level.  ...  Related work There is a vast literature on planning and scheduling techniques in manufacturing based on multi-agent systems (see, e.g., Shen et al., 2006 Shen et al., , 2007 Wang et al., 2008) .  ... 
doi:10.1016/j.cie.2012.09.004 fatcat:w7tcotphfzgfthwolgqfxxlyhe

An Efficient Scheduling Algorithm for Multi-Robot Task Allocation in Assembling Aircraft Structures [article]

Veniamin Tereshchuk, John Stewart, Nikolay Bykov, Samuel Pedigo, Santosh Devasia, Ashis G. Banerjee
2019 arXiv   pre-print
Subsequently, we deal with the failures by allowing the robots to first complete their nominal schedules and then employing a market-based optimizer to allocate the leftover tasks.  ...  Results show an improvement of 11.5\% in schedule efficiency as compared to an optimized greedy multi-agent scheduler on a four robot system, which is especially promising for aircraft assembly processes  ...  In the second stage, the tasks leftover during the failures are reallocated using a market-based optimizer to enable efficient, collision-free cooperation.  ... 
arXiv:1902.08905v2 fatcat:hbpqpsw4ovcf3mhmgux5tme25a

A market-based computational approach to collaborative organizational learning

P-S Deng, E G Tsacle
2003 Journal of the Operational Research Society  
There is also an incentive mechanism in the organizational knowledge market. a ee Market based computational approach 933 Call Agent D——+— Task T; | Winner Agent D | Call Agent A——+—Task 7 Winner Agent  ...  P-S Deng and EG Tsacle—Market based computational approach In turn, this capital modification will initiate an update of capital distribution over a group of agents through the capital reallocation/distribution  ... 
doi:10.1057/palgrave.jors.2601604 fatcat:bmxiykh25fdx5muintbdwv5co4

A Modified Distributed Bees Algorithm for Multi-Sensor Task Allocation

Itshak Tkach, Aleksandar Jevtić, Shimon Nof, Yael Edan
2018 Sensors  
The algorithm was compared to a Distributed Bees Algorithm (DBA), a Bees System, and two common multi-sensor algorithms, market-based and greedy-based algorithms, which were fitted for the specific task  ...  Sensors are allocated to tasks based on sensors' performance, tasks' priorities, and the distances of the sensors from the locations where the tasks are being executed.  ...  market-based approaches applied in multi agent systems [19] [20] [21] [22] [23] , and dynamic allocation and coalition-based approach [24] [25] [26] [27] [28] [29] [30] [31] .  ... 
doi:10.3390/s18030759 pmid:29498683 pmcid:PMC5876720 fatcat:gbhpyfl6jzbpjihccdzpsu52oy

Moving task allocation and reallocation method based on body expansion behaviour for distributed multi-robot coordination

Guanghui Li, Yusuke Tamura, Atsushi Yamashita, Hajime Asama
2012 International Journal of Mechatronics and Automation  
For such new domain, we first propose a method, called dynamical-sequential task allocation and reallocation, by implementing multi-round negotiation and body expansion behaviour.  ...  The inconvenience and cost of utilising existing task assignment approaches to resolve dynamical mobile task allocation.  ...  And this paper is a revised and expanded version of our international conference paper entitled 'Dynamical task allocation and reallocation based on body expansion behaviour for multi-robot coordination  ... 
doi:10.1504/ijma.2012.050495 fatcat:6ouxxpfgr5b6rb42fdopi524yi

Multi-robot Task Allocation: A Review of the State-of-the-Art [chapter]

Alaa Khamis, Ahmed Hussein, Ahmed Elmogy
2015 Studies in Computational Intelligence  
This problem is known as Multi-robot Task Allocation (MRTA) problem.  ...  This chapter provides a comprehensive review on challenging aspects of MRTA problem, recent approaches to tackle this problem and the future directions.  ...  However and as concluded in [42] , optimization-based approach outperforms market-based approach in handling large-scale MRTA scenario (fifty tasks and fifteen robots). • Online input: market-based approaches  ... 
doi:10.1007/978-3-319-18299-5_2 fatcat:rl7iuzhzcrdafivp27pw4q3kvu

Review of Dynamic Task Allocation Methods for UAV Swarms Oriented to Ground Targets

Qiang Peng, Husheng Wu, Ruisong Xue
2021 Complex System Modeling and Simulation  
Third, the research status and the advantages and disadvantages of several common dynamic task allocation algorithms, such as the algorithm based on market mechanisms, intelligent optimization algorithm  ...  Dynamic task allocation of unmanned aerial vehicle swarms for ground targets is an important part of unmanned aerial vehicle (UAV) swarms task planning and the key technology to improve autonomy.  ...  [35] , the distributed cooperative auction algorithm based on multiple agents was used to study the task reallocation problem, and task reallocation for cases involving new targets was simulated; the  ... 
doi:10.23919/csms.2021.0022 fatcat:da54znxyb5hfzngac6uuqy4wr4

Real Time Scheduling of Data Transmission Sessions in a Microsatellites Swarm and Ground Stations Network Based on Multi-Agent Technology

P. Skobelev, E. Simonova, A. Ivanov, I. Mayorov, V. Travin, A. Zhilyaev
2014 Proceedings of the International Conference on Evolutionary Computation Theory and Applications  
The advantages of multi-agent solution are high adaptability, flexibility and efficiency of services.  ...  Multi-agent technology for solving the problem by adaptive resource allocation and scheduling is proposed.  ...  With the use of multi-agent scheduling system for the the same number of tasks it will be enough to use only two stations.  ... 
doi:10.5220/0005034301530159 dblp:conf/ijcci/SkobelevSIMTZ14 fatcat:6g5jsxwv2bdr5pnh6zzmjswreq

Non-cooperative, semi-cooperative, and cooperative games-based grid resource allocation

S.U. Khan, I. Ahmad
2006 Proceedings 20th IEEE International Parallel & Distributed Processing Symposium  
it cannot perform the work itself, and 3) the cooperative method in which all of the sites deliberate with one another to execute all the tasks as efficiently as possible.  ...  any task execution guarantee.  ...  On the other hand BASE which uses no informed decision on task allocation performs the worst among all the techniques.  ... 
doi:10.1109/ipdps.2006.1639358 dblp:conf/ipps/KhanA06 fatcat:rzkrplwvqbhw5g52dz45flffte

Multi-agent Planning of the Network Traffic between Nanosatellites and Ground Stations

Igor Belokonov, Petr Skobelev, Elena Simonova, Vitaliy Travin, Alexey Zhilyaev
2015 Procedia Engineering  
Multi-agent technologies application for adaptive planning of communication sessions establishment requests with nanosatellites in the ground stations network in response to the arising events, considering  ...  Method of coupled interactions extension based on the demand-resource networks model for operative requests allocation for communication sessions between ground stations and nanosatellites implementation  ...  For these tasks solution it is suggested to use multi-agent technologies based on the demand-resource networks (DRN) [2, 3] .  ... 
doi:10.1016/j.proeng.2015.04.103 fatcat:kbe2ntkojzgufpidbw7gjzuytu
« Previous Showing results 1 — 15 out of 6,443 results