Comparison of DCSP Algorithms: A Case Study for Multi-agent Exploration

Monier, Pierre; Doniec, Arnaud; Piechowiak, Sylvain; Mandiau, René

doi:10.1007/978-3-642-19875-5_30

Cited by 3 publications

(5 citation statements)

References 7 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Although being flexible instruments, the existing software platforms (eg, DisChoco, which was frequently used to evaluate new DisCSP algorithms and to find the suitable variant for a specific distributed constraint problem) reveal only the output obtained after running a concurrent algorithm, without details about the evolution between the initial and final states. Such information can be provided by a model.…”

Section: Related Workmentioning

confidence: 99%

“…Although being flexible instruments, the existing software platforms (eg, DisChoco, 29 DisCSP implementation, is between these 2 cases. It allows a more profound evaluation of DisCSP algorithms' operation than a simulation environment, and the model is also close to a prototype so that a user can easily pass from model to real implementation.…”

Section: Assessment Of Discsp Algorithmsmentioning

confidence: 99%

“…DisCSP proves to provide solutions for problems on resource allocation, [14][15][16] planning/scheduling and timetabling/meeting problems, [17][18][19][20][21][22][23][24][25][26] biochemistry, 27 multirobot planning and exploration, [28][29][30][31][32] and distributed configuration. 33,34 In the last years, an application area for DisCSP that had an important development regards various types of networks; one can find results on the use of DisCSP in cognitive radio networks, 35 wireless communication networks, 6,7 and sensor networks.…”

mentioning

confidence: 99%

See 2 more Smart Citations

A colored Petri net model for DisCSP algorithms

Pascal

Pănescu

2017

Concurrency and Computation

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: Related Workmentioning

confidence: 99%

Section: Assessment Of Discsp Algorithmsmentioning

confidence: 99%

mentioning

confidence: 99%

See 1 more Smart Citation

A colored Petri net model for DisCSP algorithms

Pascal

Pănescu

2017

Concurrency and Computation

View full text Add to dashboard Cite

show abstract

“…A DisCSP modelling was used for road traffic in [13], [14], and we would like to apply our model of privacy for road traffic simulation where the agents/drivers may choose whether to reveal some private data concerning for example their driving, or their habits. Indeed, we think that our privacy model may also be adapted to other applications such as multi-robot exploration [44] or smart energy [49].…”

Section: B Experiments On Udiscpmentioning

confidence: 99%

Distributed Constraint Problems for Utilitarian Agents with Privacy Concerns, Recast as POMDPs

Savaux,

Vion,

Piechowiak

et al. 2017

Preprint

Self Cite

View full text Add to dashboard Cite

Privacy has traditionally been a major motivation for distributed problem solving. Distributed Constraint Satisfaction Problem (DisCSP) as well as Distributed Constraint Optimization Problem (DCOP) are fundamental models used to solve various families of distributed problems. Even though several approaches have been proposed to quantify and preserve privacy in such problems, none of them is exempt from limitations. Here we approach the problem by assuming that computation is performed among utilitarian agents. We introduce a utilitarian approach where the utility of each state is estimated as the difference between the reward for reaching an agreement on assignments of shared variables and the cost of privacy loss. We investigate extensions to solvers where agents integrate the utility function to guide their search and decide which action to perform, defining thereby their policy. We show that these extended solvers succeed in significantly reducing privacy loss without significant degradation of the solution quality.

show abstract

“…Solving the problem determines the next action to be performed; this alters the agent's representation of the world. -Multi-robot exploration [51,52,56,60]-A third application considers a fleet of autonomous robots exploring an unknown environment. These robots are agents that build a representation in which other agents are considered as variables.…”

mentioning

confidence: 99%

Multi-variable distributed backtracking with sessions

et al. 2014

Self Cite

View full text Add to dashboard Cite

The Constraint Satisfaction Problem (CSP) formalism is used to represent many combinatorial decision problems instances simply and efficiently. However, many such problems cannot be solved on a single, centralized computer for various reasons (e.g., their excessive size or privacy). The Distributed CSP (DisCSP) extends the CSP model to allow such combinatorial decision problems to be modelled and handled. In this paper, we propose a complete DisCSP-solving algorithm, called Distributed Backtracking with Sessions (DBS), which can solve DisCSP so that each agent encapsulates a whole "complex" problem with many variables and constraints. We prove that the algorithm is sound and complete, and generates promising experimental results.

show abstract

Comparison of DCSP Algorithms: A Case Study for Multi-agent Exploration

Cited by 3 publications

References 7 publications

A colored Petri net model for DisCSP algorithms

A colored Petri net model for DisCSP algorithms

Distributed Constraint Problems for Utilitarian Agents with Privacy Concerns, Recast as POMDPs

Multi-variable distributed backtracking with sessions

Contact Info

Product

Resources

About