File Download
There are no files associated with this item.
Supplementary
-
Citations:
- Scopus: 0
- Appears in Collections:
Article: A closed-loop bid adjustment approach to dynamic task allocation of robots
Title | A closed-loop bid adjustment approach to dynamic task allocation of robots |
---|---|
Authors | |
Keywords | Auction Bid Adjustment Dynamic Environments Multi-Robot Task Allocation |
Issue Date | 2011 |
Publisher | International Association of Engineers. The Journal's web site is located at http://www.engineeringletters.com/ |
Citation | Engineering Letters, 2011, v. 19 n. 4 How to Cite? |
Abstract | 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 aim to assemble robot team information at a single location to make practicable decisions on task allocation. However, a main deficiency of auction-based methods is that robots generally do not have sufficient information to estimate accurate and reliable bids to perform tasks, particularly in dynamic environments where there are operational uncertainties. 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 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 ssesses and records its performance to reflect the discrepancy between the submitted bid price and the corresponding actual cost of the task. A series of such performance records, with time-discounting factors, are taken into account to damp out fluctuations of bid adjustments. 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 bid adjustment mechanism. |
Persistent Identifier | http://hdl.handle.net/10722/155952 |
ISSN | 2023 Impact Factor: 0.4 2023 SCImago Journal Rankings: 0.245 |
References |
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Zhu, WK | en_US |
dc.contributor.author | Choi, SH | en_US |
dc.date.accessioned | 2012-08-08T08:38:35Z | - |
dc.date.available | 2012-08-08T08:38:35Z | - |
dc.date.issued | 2011 | en_US |
dc.identifier.citation | Engineering Letters, 2011, v. 19 n. 4 | en_US |
dc.identifier.issn | 1816-093X | en_US |
dc.identifier.uri | http://hdl.handle.net/10722/155952 | - |
dc.description.abstract | 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 aim to assemble robot team information at a single location to make practicable decisions on task allocation. However, a main deficiency of auction-based methods is that robots generally do not have sufficient information to estimate accurate and reliable bids to perform tasks, particularly in dynamic environments where there are operational uncertainties. 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 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 ssesses and records its performance to reflect the discrepancy between the submitted bid price and the corresponding actual cost of the task. A series of such performance records, with time-discounting factors, are taken into account to damp out fluctuations of bid adjustments. 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 bid adjustment mechanism. | en_US |
dc.language | eng | en_US |
dc.publisher | International Association of Engineers. The Journal's web site is located at http://www.engineeringletters.com/ | en_US |
dc.relation.ispartof | Engineering Letters | en_US |
dc.subject | Auction | en_US |
dc.subject | Bid Adjustment | en_US |
dc.subject | Dynamic Environments | en_US |
dc.subject | Multi-Robot | en_US |
dc.subject | Task Allocation | en_US |
dc.title | A closed-loop bid adjustment approach to dynamic task allocation of robots | en_US |
dc.type | Article | en_US |
dc.identifier.email | Choi, SH:shchoi@hkucc.hku.hk | en_US |
dc.identifier.authority | Choi, SH=rp00109 | en_US |
dc.description.nature | link_to_subscribed_fulltext | en_US |
dc.identifier.scopus | eid_2-s2.0-81155153652 | en_US |
dc.relation.references | http://www.scopus.com/mlt/select.url?eid=2-s2.0-81155153652&selection=ref&src=s&origin=recordpage | en_US |
dc.identifier.volume | 19 | en_US |
dc.identifier.issue | 4 | en_US |
dc.publisher.place | Hong Kong | en_US |
dc.identifier.scopusauthorid | Zhu, WK=7404232249 | en_US |
dc.identifier.scopusauthorid | Choi, SH=7408119615 | en_US |
dc.identifier.issnl | 1816-093X | - |