Skip to main content

Consensus Variable Approach to Decentralized Adaptive Scheduling

  • Chapter

Part of the book series: Lecture Notes in Economics and Mathematical Systems ((LNE,volume 588))

Summary

We present a new approach to solving adaptive scheduling problems in decentralized systems, based on the concept of nearest-neighbor negotiations and the idea of a consensus variable. Exploiting some recent extensions to existing results for single consensus variables, the adaptive scheduling problem is solved by choosing task timings as the consensus variables in the system. This application is illustrated via the example of a synchronized strike mission. The chapter concludes with a discussion of future research directions on this topic.

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 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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. W. Ren, R.W. Beard, and T.W. McLain, “Coordination Variables and Consensus Building in Multiple Vehicle Systems,” Proceedings of the Block Island Workshop on Cooperative Control, Springer-Verlag Series: Lecture Notes in Control and Information Sciences, vol. 309, 2005.

    Google Scholar 

  2. K. L. Moore and D. Lucarelli, “Force and constrained consensus among cooperating agents,” in 2005 IEEE International Conference on Networking, Sensing, and Control, Tuscon, AZ, March 2005.

    Google Scholar 

  3. R. Brockett and D. Liberzon, “Quantized feedback stabilization of linear systems,” IEEE Transactions on Automatic Control, vol. 48, pp. 1279–1289, 2000.

    Article  MathSciNet  Google Scholar 

  4. N. Elia and S. Mitter, “Stabilization of linear systems with limited information,” IEEE Transactions on Automatic Control, vol. 46, pp. 1384–1400, 2001.

    Article  MATH  MathSciNet  Google Scholar 

  5. S. Tatikonda and S. Mitter, “Control under communication constraints,” IEEE Transactions on Automatic Control, vol. 49, pp. 1056–1068, July 2004.

    Article  MathSciNet  Google Scholar 

  6. R. Dechter, I. Meiri, and J. Pearl, “Temporal constraint networks,” Artificial Intelligence, vol. 49, pp. 61–95, 1991.

    Article  MATH  MathSciNet  Google Scholar 

  7. M. Tambe, “Towards flexible teamwork,” Journal of Artificial Intelligence Research, vol. 7, pp. 83–124, 1997.

    Google Scholar 

  8. W. Ren, R. W. Beard, and D. Kingston, “Multi-agent Kalman Consensus with Relative Uncertainty,” in 2005 American Control Conference, Portland, OR, June 2005.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2007 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

Moore, K.L., Lucarelli, D. (2007). Consensus Variable Approach to Decentralized Adaptive Scheduling. In: Grundel, D., Murphey, R., Pardalos, P., Prokopyev, O. (eds) Cooperative Systems. Lecture Notes in Economics and Mathematical Systems, vol 588. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-48271-0_10

Download citation

Publish with us

Policies and ethics