FRINK Linked Data Fragments server

Matches in SemOpenAlex for { <https://semopenalex.org/work/W831571386> ?p ?o ?g. }

• W831571386 abstract "In this paper, we present provably-good distributed task allocation (assignment) algorithms for a heterogeneous multi-robot system where the tasks form disjoint groups and there are constraints on the number of tasks a robot can do (both within the overall mission and within each task group). Our problem is motivated by applications where multiple robots with heterogeneous capabilities have to work together to accomplish tasks. Thus, for our purposes, a task group is a compound task composed of more than one atomic tasks where one robot is required for each atomic task. Since robots have limited battery life, we assume that the number of (atomic) tasks that a robot can do within a mission has an upper bound. Futhermore, each robot has a constraint on the number of tasks it can do from each group (this models the fact that multiple robots may be needed to simultaneously perform the atomic tasks that make up the compound task). Each robot obtains a payoff (or incurs a cost) for each task and the overall objective for task allocation is to maximize the total payoff (or minimize the total cost) of all the robots. In general, existing (centralized or distributed) algorithms for task allocation either assume that (atomic) tasks are independent, or do not provide performance guarantee for the situation where task constraints exist. We show that our problem can be solved in polynomial time by a centralized algorithm by reducing it to a minimum cost network flow problem. We then present a decentralized algorithm (that extends the auction algorithm of Bertsekas for linear assignment problems [1]) to provide an almost optimal solution. We prove that our solution is within a factor of O(nte) of the optimal solution, where nt is the total number of tasks and e is a parameter that we choose (the guarantees are the same as that of the original auction algorithm for unconstrained tasks). The decentralized algorithm assumes a shared memory model of computation that may be unrealistic for many multi-robot deployments. Therefore, we show that by using a maximum consensus algorithm along with our algorithm, we can design a totally distributed algorithm for task allocation with group constraints. The key aspect of our distributed algorithm is that the overall objective is (nearly) maximized by each robot maximizing its own objective iteratively (using a modified payoff function based on an auxiliary variable, called price of a task). Our algorithm is polynomial in the number of tasks as well as the number of robots." @default.
• W831571386 created "2016-06-24" @default.
• W831571386 creator A5008577423 @default.
• W831571386 creator A5073041312 @default.
• W831571386 creator A5087505541 @default.
• W831571386 date "2012-01-01" @default.
• W831571386 modified "2023-09-26" @default.
• W831571386 title "A Distributed Algorithm for Constrained Multi-Robot Task Assignment for Grouped Tasks" @default.
• W831571386 cites W1508840430 @default.
• W831571386 cites W1603765807 @default.
• W831571386 cites W1964486323 @default.
• W831571386 cites W1978382073 @default.
• W831571386 cites W2000647280 @default.
• W831571386 cites W2009070933 @default.
• W831571386 cites W2057265280 @default.
• W831571386 cites W2088379700 @default.
• W831571386 cites W2088668112 @default.
• W831571386 cites W2103001076 @default.
• W831571386 cites W2107396783 @default.
• W831571386 cites W2107918847 @default.
• W831571386 cites W2113257089 @default.
• W831571386 cites W2126366668 @default.
• W831571386 cites W2128285524 @default.
• W831571386 cites W2135132740 @default.
• W831571386 cites W2137714578 @default.
• W831571386 cites W2142417067 @default.
• W831571386 cites W2142544818 @default.
• W831571386 cites W2143082482 @default.
• W831571386 cites W2143704222 @default.
• W831571386 cites W2144827113 @default.
• W831571386 cites W2157488300 @default.
• W831571386 cites W2222512263 @default.
• W831571386 cites W2269887993 @default.
• W831571386 cites W2373591242 @default.
• W831571386 cites W2467020497 @default.
• W831571386 cites W2491954325 @default.
• W831571386 hasPublicationYear "2012" @default.
• W831571386 type Work @default.
• W831571386 sameAs 831571386 @default.
• W831571386 citedByCount "1" @default.
• W831571386 countsByYear W8315713862015 @default.
• W831571386 crossrefType "journal-article" @default.
• W831571386 hasAuthorship W831571386A5008577423 @default.
• W831571386 hasAuthorship W831571386A5073041312 @default.
• W831571386 hasAuthorship W831571386A5087505541 @default.
• W831571386 hasConcept C114614502 @default.
• W831571386 hasConcept C120314980 @default.
• W831571386 hasConcept C126255220 @default.
• W831571386 hasConcept C127413603 @default.
• W831571386 hasConcept C144237770 @default.
• W831571386 hasConcept C154945302 @default.
• W831571386 hasConcept C175154964 @default.
• W831571386 hasConcept C201995342 @default.
• W831571386 hasConcept C22171661 @default.
• W831571386 hasConcept C2780451532 @default.
• W831571386 hasConcept C33923547 @default.
• W831571386 hasConcept C41008148 @default.
• W831571386 hasConcept C45340560 @default.
• W831571386 hasConcept C90509273 @default.
• W831571386 hasConceptScore W831571386C114614502 @default.
• W831571386 hasConceptScore W831571386C120314980 @default.
• W831571386 hasConceptScore W831571386C126255220 @default.
• W831571386 hasConceptScore W831571386C127413603 @default.
• W831571386 hasConceptScore W831571386C144237770 @default.
• W831571386 hasConceptScore W831571386C154945302 @default.
• W831571386 hasConceptScore W831571386C175154964 @default.
• W831571386 hasConceptScore W831571386C201995342 @default.
• W831571386 hasConceptScore W831571386C22171661 @default.
• W831571386 hasConceptScore W831571386C2780451532 @default.
• W831571386 hasConceptScore W831571386C33923547 @default.
• W831571386 hasConceptScore W831571386C41008148 @default.
• W831571386 hasConceptScore W831571386C45340560 @default.
• W831571386 hasConceptScore W831571386C90509273 @default.
• W831571386 hasLocation W8315713861 @default.
• W831571386 hasOpenAccess W831571386 @default.
• W831571386 hasPrimaryLocation W8315713861 @default.
• W831571386 hasRelatedWork W1019382921 @default.
• W831571386 hasRelatedWork W123913769 @default.
• W831571386 hasRelatedWork W1547850430 @default.
• W831571386 hasRelatedWork W2020313791 @default.
• W831571386 hasRelatedWork W2116069343 @default.
• W831571386 hasRelatedWork W2158970689 @default.
• W831571386 hasRelatedWork W2265014068 @default.
• W831571386 hasRelatedWork W2481452269 @default.
• W831571386 hasRelatedWork W2783470043 @default.
• W831571386 hasRelatedWork W2797358850 @default.
• W831571386 hasRelatedWork W2804531846 @default.
• W831571386 hasRelatedWork W2923254569 @default.
• W831571386 hasRelatedWork W2942394565 @default.
• W831571386 hasRelatedWork W2954310801 @default.
• W831571386 hasRelatedWork W3004038152 @default.
• W831571386 hasRelatedWork W3131655721 @default.
• W831571386 hasRelatedWork W3137993700 @default.
• W831571386 hasRelatedWork W3175254818 @default.
• W831571386 hasRelatedWork W2841691032 @default.
• W831571386 hasRelatedWork W3123139617 @default.
• W831571386 isParatext "false" @default.
• W831571386 isRetracted "false" @default.
• W831571386 magId "831571386" @default.
• W831571386 workType "article" @default.