Skip to main content

Extended Conflict-Based Search with Awareness

  • Chapter
  • First Online:
Integrated Intelligent Computing, Communication and Security

Part of the book series: Studies in Computational Intelligence ((SCI,volume 771))

  • 837 Accesses

Abstract

Extended Conflict-Based Search (XCBS) is a distributed agent-based approach which has been used for path finding and scheduling of spatially extended agents on a traversable network. The algorithm arrives at an optimal schedule while resolving conflicts between pairs of agents one at a time. In this chapter, we propose XCBS with Awareness wherein a conflicting agent plan is resolved with respect to the proposed route plan of other agents. The approach allows multiple conflicts to be resolved simultaneously, avoids cascading conflicts in the new plans and shows an improved efficiency in terms of nodes explored and time taken to arrive at the solution.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 89.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 119.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 169.99
Price excludes VAT (USA)
  • Durable hardcover 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

Institutional subscriptions

References

  1. Standley, T., and R. Korf. 2011. Complete algorithms for cooperative pathfinding problems. In IJCAI, 668–673.

    Google Scholar 

  2. Qiuy Ling, Wen-Jing Hsuy, Shell-Ying Hunagy and Han Wang. 2002. Scheduling and routing algorithms for AGVs: A survey. International Journal of Production Research, 40 (3): 745–760.

    Article  Google Scholar 

  3. Bodin, L.D.,B.L. Golden, A. Assad, and M. Ball. 1983. Routing and scheduling of vehicles and crews: The state of the art. Computers and Operation Research, 10: 63–211.

    Google Scholar 

  4. Thomas, S., D. Deodhare, and M.N. Murty. 2015. Extended Conflict Based Search for Convoy Movement Problem. IEEE Intelligent Systems 60 (3): 67–76.

    Google Scholar 

  5. Dinh, H.T., R.S. Rinde, T. Holvoet. 2016. Multi-agent route planning using delegate MAS. In ICAPS proceedings of the 4th workshop on distributed and multi-agent planning, 24–32.

    Google Scholar 

  6. Kumar A., I. Murugeswari, D. Khemani and N. Narayanaswamy. Planning for convoy movement problem. In ICAART 2012-Proceedings of the 4th International Conference on Agents and Artificial Intelligence, 495–498.

    Google Scholar 

  7. Thomas, S., N. Dhiman, P. Tikkas, A. Sharma and D. Deodhare. 2008. Towards faster execution of OODA loop using dynamic Decision Support System. In 3rd international conference on information warfare and security (ICIW).

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Shyni Thomas .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2019 Springer Nature Singapore Pte Ltd.

About this chapter

Check for updates. Verify currency and authenticity via CrossMark

Cite this chapter

Thomas, S., Deodhare, D., Narasimha Murty, M. (2019). Extended Conflict-Based Search with Awareness. In: Krishna, A., Srikantaiah, K., Naveena, C. (eds) Integrated Intelligent Computing, Communication and Security. Studies in Computational Intelligence, vol 771. Springer, Singapore. https://doi.org/10.1007/978-981-10-8797-4_47

Download citation

Publish with us

Policies and ethics