An Extended Contract Net Protocol with Direct Negotiation of Managers

Pănescu, Doru; Pascal, Carlos

doi:10.1007/978-3-319-04735-5_6

Cited by 7 publications

(4 citation statements)

References 11 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…It can be used for different problems, with diverse number of agents and distinct constraints. Moreover, the CPN model could be used for solving coordination in holonic manufacturing systems . The model could be employed in checking different properties (eg, the set of existent solutions, absence of deadlocks, communication, and computation load) as well as in testing diverse manufacturing scenarios for distributed manufacturing systems.…”

Section: Discussionmentioning

confidence: 99%

“…The DisCSP algorithms have been implied in manufacturing control architectures, mainly in the research field; even so, they were rarely applied in real‐life problems, the weak adoption of multiagent control systems being discussed in Leitão . About this, the use of a CPN model can facilitate the design and implementation of multiagent and holonic control schemes . In a holonic system, the coordination problem is often solved by using the contract net protocol (CNP) .…”

Section: Related Workmentioning

confidence: 99%

“…About this, the use of a CPN model can facilitate the design and implementation of multiagent and holonic control schemes . In a holonic system, the coordination problem is often solved by using the contract net protocol (CNP) . In such a case, the CPN model allows to test the way negotiation between holons conducts to the needed holarchies.…”

Section: Related Workmentioning

confidence: 99%

See 2 more Smart Citations

A colored Petri net model for DisCSP algorithms

Pascal

Pănescu

2017

Concurrency and Computation

Self Cite

View full text Add to dashboard Cite

Summary The aim of this paper is to present a colored Petri net that models a system applying a DisCSP method. Our study considered 3 representative DisCSP algorithms: synchronous backtracking, asynchronous backtracking, and weak‐commitment search. To obtain the model, it was necessary to transpose the operation of a DisCSP‐based system into a discrete event system. The constructed colored Petri net is presented, with details on the information stored in places, procedures associated with transitions, and communication between agents. Through the performed trials (with the n‐queens problem), it was proved that the model is correct, easy to use, and adaptable to different operation conditions. The conducted simulations revealed new results about the way the 3 analyzed algorithms compare one with the other. It was showed that the performance of weak‐commitment search is degrading in cases close to real conditions, namely, when agents use un‐updated information about the state of system. We could also study 3 strategies for improving the performance of DisCSP algorithms, making them more practicable. The proposed model is available for open use, it is independent of the software that carries out a DisCSP method, and it can be enhanced for other DisCSP algorithms and diverse communication schemes.

show abstract

Section: Discussionmentioning

confidence: 99%

Section: Related Workmentioning

confidence: 99%

Section: Related Workmentioning

confidence: 99%

See 1 more Smart Citation

A colored Petri net model for DisCSP algorithms

Pascal

Pănescu

2017

Concurrency and Computation

Self Cite

View full text Add to dashboard Cite

show abstract

“…It offers a simple and general mechanism for solving coordination of manufacturing entities, and thus it was included in manufacturing planning, scheduling, reconfiguration and control schemes [22][23][24][25]. However, CNP in its original form can conduct to several drawbacks with respect to the optimality and completeness of provided results and thus different extensions of CNP were proposed; some of these improvements are reviewed in [25]. They regard the tuning of CNP in accordance with the type of relations between agents (cooperative/competitive), the adding of a centralized component within the coordination protocol and the possibility of improving the way contractors can make bids that exceed their capacities, so that no solution to be lost.…”

Section: Related Work; Proposed Research Goalsmentioning

confidence: 99%