Skip to main content
Disciplines
Automotive Business IT + Informatics Construction + Real Estate Electrical Engineering + Electronics Energy + Sustainability Insurance + Risk Finance + Banking Management + Leadership Marketing + Sales Mechanical Engineering + Materials
Events
DE
EN
Books
Journals
Topic Page
Marketing
Start single access now
Access for companies
EXTENDED SEARCH
Log in
Top
Published in:
A Hybrid POMDP-BDI Agent Architecture with Online Stochastic Planning and Desires with Changing Intensity Levels Read chapter Read first chapter

2015 | OriginalPaper | Chapter

Using Process Calculi for Plan Verification in Multiagent Planning

Authors : Jan Jakubův, Jan Tožička, Antonín Komenda

Published in: Agents and Artificial Intelligence

Publisher: Springer International Publishing

Log in

Activate our intelligent search to find suitable subject content or patents.

search-config
loading …

Abstract

Multiagent planning is a coordination technique used for deliberative acting of a team of agents. One of vital planning techniques uses declarative description of agents’ plans based on Finite State Machines and their later coordination by intersection of such machines with successive verification of the resulting joint plans.
In this work, we firstly introduce a method of multiagent planning which makes use of projections of other agent actions in order to iteratively search for a skeleton of a multiagent plan. Secondly, we describe integration of the static analysis provided by process calculi type systems for approximate verification of exchanged local plans. Furthermore, we introduce an alternative method to accomplish the above verification by a classical planner. Finally, we compare our approach with current state-of-the-art planner on an extensive benchmark set.

Dont have a licence yet? Then find out more about our products and how to get one now:

Springer Professional "Wirtschaft+Technik"

Online-Abonnement

Mit Springer Professional "Wirtschaft+Technik" erhalten Sie Zugriff auf:

  • über 102.000 Bücher
  • über 537 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Maschinenbau + Werkstoffe
  • Versicherung + Risiko

Jetzt Wissensvorsprung sichern!

inform now

Springer Professional "Technik"

Online-Abonnement

Mit Springer Professional "Technik" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 390 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Maschinenbau + Werkstoffe




 

Jetzt Wissensvorsprung sichern!

inform now

Springer Professional "Wirtschaft"

Online-Abonnement

Mit Springer Professional "Wirtschaft" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 340 Zeitschriften

aus folgenden Fachgebieten:

  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Versicherung + Risiko




Jetzt Wissensvorsprung sichern!

inform now
previous chapter A Heuristic for Constrained Set Partitioning in the Light of Heterogeneous Objectives
next chapter Speeding up Planning in Multiagent Settings Using CPU-GPU Architectures
Footnotes
1
These two conditions rules out private goals and joint actions. Any MA-Strips problem which does not satisfy the two conditions can be translated to an equivalent problem which satisfies them. However, a solution that would take advantage of private goals and joint actions is left for future research.
 
2
Although a PSM as defined here suggests a deterministic finite state machine, a non-deterministic transitions can be introduced by public projection defined later. Thus we prefer to work with non-deterministic machines from the beginning.
 
4
Briefly, for a delete effect \(p\not \in \mathsf {\mathsf {pre}}(a)\), we can introduce a new fact \(p^{-}\) complementary to p and then provide two rewriting rule axioms for \(a\); the first applies in states where p holds while the second in states where \(p^{-}\) holds.
 
5
All the tests were performed on a single PC, CPU Intel i7 3.40 GHz with 8 cores, and memory limited to 8GB RAM.
 
6
We would like to thank the authors of FMAP for a kind support with their planner.
 
7
However, there were still two individual problems which were solved by PSM but not by PSM✶. As this happens relatively rarely, it is left for future research to find out whether this is because of the approximation in Poly✶ analysis or whether it can happen that in some cases a useful landmark is constructed from a rejected plan part.
 
Literature
1.
Bhattacharya, S., Kumar, V., Likhachev, M.: Search-based path planning with homotopy class constraints. In: Felner, A., Sturtevant, N.R. (eds.) SOCS. AAAI Press, Menlo Park (2010)
2.
Brafman, R., Domshlak, C.: From one to many: planning for loosely coupled multi-agent systems. In: Proceedings of ICAPS 2008, vol. 8, pp. 28–35 (2008)
3.
Fikes, R., Nilsson, N.: STRIPS: a new approach to the application of theorem proving to problem solving. In: Proceedings of the 2nd International Joint Conference on Artificial Intelligence, pp. 608–620 (1971)
4.
Hopcroft, J.E., Motwani, R., Ullman, J.D.: Introduction to Automata Theory, Languages, and Computation, 3rd edn. Addison-Wesley Longman Publishing Co., Inc., Boston (2006)MATH
5.
Jakubův, J., Wells, J.B.: Expressiveness of generic process shape types. In: Wirsing, M., Hofmann, M., Rauschmayer, A. (eds.) TGC 2010. LNCS, vol. 6084, pp. 103–119. Springer, Heidelberg (2010) CrossRef
6.
Makholm, H., Wells, J.B.: Instant polymorphic type systems for mobile process calculi: just add reduction rules and close. In: Sagiv, M. (ed.) ESOP 2005. LNCS, vol. 3444, pp. 389–407. Springer, Heidelberg (2005) CrossRef
7.
8.
Štolba, M., Komenda, A.: Relaxation heuristics for multiagent planning. In: Proceedings of ICAPS 2014 (2014)
9.
10.
Tožička, J., Jakubův, J., Durkota, K., Komenda, A., Pěchouček, M.: Multiagent planning supported by plan diversity metrics and landmark actions. In: Proceedings ICAART 2014 (2014)
11.
Tožička, J., Jakubův, J., Komenda, A.: Generating multi-agent plans by distributed intersection of finite state machines. In: Proceedings ECAI 2014, pp. 1111–1112 (2014)
Metadata
Title
Using Process Calculi for Plan Verification in Multiagent Planning
Authors
Jan Jakubův
Jan Tožička
Antonín Komenda
Copyright Year
2015
Book
Agents and Artificial Intelligence

Print ISBN: 978-3-319-27946-6

Electronic ISBN: 978-3-319-27947-3

Copyright Year: 2015

DOI
https://doi.org/10.1007/978-3-319-27947-3_13

Premium Partner

    Image Credits