An Incremental Self-Deployment Algorithm for Mobile Sensor Networks
Autonomous Robots
Algorithms for Distributed Constraint Satisfaction: A Review
Autonomous Agents and Multi-Agent Systems
Collaborative Reputation Mechanisms in Electronic Marketplaces
HICSS '99 Proceedings of the Thirty-second Annual Hawaii International Conference on System Sciences-Volume 8 - Volume 8
The Knowledge Engineering Review
Comparing two approaches to dynamic, distributed constraint satisfaction
Proceedings of the fourth international joint conference on Autonomous agents and multiagent systems
Artificial Intelligence - Special issue: Distributed constraint satisfaction
Adopt: asynchronous distributed constraint optimization with quality guarantees
Artificial Intelligence - Special issue: Distributed constraint satisfaction
Nogood based asynchronous distributed optimization (ADOPT ng)
AAMAS '06 Proceedings of the fifth international joint conference on Autonomous agents and multiagent systems
Solving Coarse-grained DisCSPs with Multi-DisPeL and DisBO-wd
IAT '07 Proceedings of the 2007 IEEE/WIC/ACM International Conference on Intelligent Agent Technology
Asynchronous Forward-Bounding for Distributed Constraints Optimization
Proceedings of the 2006 conference on ECAI 2006: 17th European Conference on Artificial Intelligence August 29 -- September 1, 2006, Riva del Garda, Italy
Anytime local search for distributed constraint optimization
AAAI'08 Proceedings of the 23rd national conference on Artificial intelligence - Volume 1
Dynamic distributed constraint reasoning
AAAI'08 Proceedings of the 23rd national conference on Artificial intelligence - Volume 3
Quality guarantees on k-optimal solutions for distributed constraint optimization problems
IJCAI'07 Proceedings of the 20th international joint conference on Artifical intelligence
A scalable method for multiagent constraint optimization
IJCAI'05 Proceedings of the 19th international joint conference on Artificial intelligence
Deception in networks of mobile sensing agents
Proceedings of the 9th International Conference on Autonomous Agents and Multiagent Systems: volume 1 - Volume 1
BnB-ADOPT: an asynchronous branch-and-bound DCOP algorithm
Journal of Artificial Intelligence Research
Distributed Gibbs: a memory-bounded sampling-based DCOP algorithm
Proceedings of the 2013 international conference on Autonomous agents and multi-agent systems
Asymmetric distributed constraint optimization problems
Journal of Artificial Intelligence Research
Hi-index | 0.00 |
A team of mobile sensors can be used for coverage of targets in different environments. The dynamic nature of such an application requires the team of agents to adjust their locations with respect to changes which occur. The dynamic nature is caused by environment changes, changes in the agents’ tasks and by technology failures. A new model for representing problems of mobile sensor teams based on Distributed Constraint Optimization Problems (DCOP), is proposed. The proposed model, needs to handle a dynamic problem in which the alternative assignments for agents and set of neighbors, derive from their physical location which is dynamic. DCOP MST enables representation of variant dynamic elements which a team of mobile sensing agents face. A reputation model is used to determine the credibility of agents. By representing the dynamic sensing coverage requirements in the same scale as the agents’ credibility, the deployment of sensors in the area can be evaluated and adjusted with correspondence to dynamic changes. In order to solve a DCOP MST, a local (incomplete) search algorithm (MGM MST) based on the MGM algorithm is proposed and combined with various exploration methods. While existing exploration methods are evidently not effective in DCOP MSTs, new exploration methods which are designed for these special applications are found to be successful in our experimental study.