Skip to main content

Decentralized Constraint Optimization in Composite Observation Task Allocation to Mobile Sensor Agents

  • Conference paper
  • First Online:

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 12092))

Abstract

Cooperative severance and observation by autonomous multiple mobile sensors have been studied for wide area monitoring, disaster response, and exploration in unsafe zones. In practical situations, sensor agents might be required to perform various composite tasks. To integrate them, the general representation of problems and decentralized solution methods for different requirements are necessary. The distributed constraint optimization problem has been studied as a general and fundamental combinational optimization problem in multiagent systems. Although several studies have applied this approach to sensor networks and teams of mobile sensors, opportunities also exit to apply it to manage composite tasks and utilize decentralized protocols in the subtasks in several layers of observation systems. As a case study, we address a cooperative observation system consisting of mobile sensor agents that temporally observe unsafe zones on a floor or a field with obstacles, where the basis of the tasks is the division of observation areas for the agents. We also allocate several tasks with high priority to several agents. We applied a decentralized constraint optimization method to the cooperation for both task allocation and the division of an observation area and experimentally verified our proposed approach in a simulated environment.

This work was supported in part by JSPS KAKENHI Grant Number JP19K12117 and Tatematsu Zaidan.

This is a preview of subscription content, log in via an institution.

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Notes

  1. 1.

    The actions might cause a small fluctuation in situations that have almost converged. But we allow this situation as dynamics of our system.

  2. 2.

    Although they can be more compactly represented, we prefer to directly represent some structures.

References

  1. Balzer, M., Schlömer, T., Deussen, O.: Capacity-constrained point distributions: a variant of Lloydf’s method. In: ACM SIGGRAPH 2009 (2009)

    Google Scholar 

  2. Béjar, R., et al.: Sensor networks and distributed CSP: communication, computation and complexity. Artif. Intell. 161(1–2), 117–147 (2005)

    Article  MathSciNet  Google Scholar 

  3. Farinelli, A., Rogers, A., Petcu, A., Jennings, N.R.: Decentralised coordination of low-power embedded devices using the max-sum algorithm. In: 7th International Joint Conference on Autonomous Agents and Multiagent Systems, pp. 639–646 (2008)

    Google Scholar 

  4. Fioretto, F., Pontelli, E., Yeoh, W.: Distributed constraint optimization problems and applications: a survey. JAIR 61, 623–698 (2018)

    Article  MathSciNet  Google Scholar 

  5. Fioretto, F., Yeoh, W., Pontelli, E.: A multiagent system approach to scheduling devices in smart homes. In: Proceedings of the 16th Conference on Autonomous Agents and MultiAgent Systems, pp. 981–989 (2017)

    Google Scholar 

  6. Hatano, D., Hirayama, K.: DeQED: an efficient divide-and-coordinate algorithm for DCOP. In: IJCAI 2013, Proceedings of the 23rd International Joint Conference on Artificial Intelligence, Beijing, China, 3–9 August 2013, pp. 566–572 (2013)

    Google Scholar 

  7. Jain, M., Taylor, M.E., Tambe, M., Yokoo, M.: DCOPs meet the real world: exploring unknown reward matrices with applications to mobile sensor networks. In: IJCAI 2009, Proceedings of the 21st International Joint Conference on Artificial Intelligence, Pasadena, California, USA, 11–17 July 2009, pp. 181–186 (2009)

    Google Scholar 

  8. Maheswaran, R.T., Pearce, J.P., Tambe, M.: Distributed algorithms for DCOP: a graphical-game-based approach. In: the International Conference on Parallel and Distributed Computing Systems, pp. 432–439 (2004)

    Google Scholar 

  9. Matsui, T., Matsuo, H., Silaghi, M., Hirayama, K., Yokoo, M.: Leximin asymmetric multiple objective distributed constraint optimization problem. Comput. Intell. 34(1), 49–84 (2018)

    Article  MathSciNet  Google Scholar 

  10. Modi, P.J., Shen, W., Tambe, M., Yokoo, M.: Adopt: asynchronous distributed constraint optimization with quality guarantees. Artif. Intell. 161(1–2), 149–180 (2005)

    Article  MathSciNet  Google Scholar 

  11. Nguyen, D.T., Yeoh, W., Lau, H.C., Zilberstein, S., Zhang, C.: Decentralized multi-agent reinforcement learning in average-reward dynamic DCOPs. In: 28th AAAI Conference on Artificial Intelligence, pp. 1447–1455 (2014)

    Google Scholar 

  12. Petcu, A., Faltings, B.: A scalable method for multiagent constraint optimization. In: 19th International Joint Conference on Artificial Intelligence, pp. 266–271 (2005)

    Google Scholar 

  13. Yeoh, W., Felner, A., Koenig, S.: BnB-ADOPT: an asynchronous branch-and-bound DCOP algorithm. In: 7th International Joint Conference on Autonomous Agents and Multiagent Systems, pp. 591–598 (2008)

    Google Scholar 

  14. Zivan, R., Yedidsion, H., Okamoto, S., Glinton, R., Sycara, K.: Distributed constraint optimization for teams of mobile sensing agents. Auton. Agent. Multi-Agent Syst. 29(3), 495–536 (2014). https://doi.org/10.1007/s10458-014-9255-3

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Toshihiro Matsui .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2020 Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Matsui, T. (2020). Decentralized Constraint Optimization in Composite Observation Task Allocation to Mobile Sensor Agents. In: Demazeau, Y., Holvoet, T., Corchado, J., Costantini, S. (eds) Advances in Practical Applications of Agents, Multi-Agent Systems, and Trustworthiness. The PAAMS Collection. PAAMS 2020. Lecture Notes in Computer Science(), vol 12092. Springer, Cham. https://doi.org/10.1007/978-3-030-49778-1_14

Download citation

  • DOI: https://doi.org/10.1007/978-3-030-49778-1_14

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-030-49777-4

  • Online ISBN: 978-3-030-49778-1

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics