论文信息 - Grid-based SensorDCSP

Grid-based SensorDCSP

We introduce Grid-based SensorDCSP, a geometrically structured benchmark problem for the study of distributed CSP algorithms. This domain provides realistic structure of the communication and tracking constraints. We formally define this problem, and perform its worst-case complexity analysis. Likewise, we provide an average case empirical analysis of the AWC algorithm, studying its behavior on tractable and intractable sub-classes of our problem.

[1] Nuttapong Chentanez,et al. Intrinsically Motivated Learning of Hierarchical Collections of Skills , 2004 .

[2] Doina Precup,et al. Between MDPs and Semi-MDPs: A Framework for Temporal Abstraction in Reinforcement Learning , 1999, Artif. Intell..

[3] Alicia P. Wolfe,et al. Identifying useful subgoals in reinforcement learning by local graph partitioning , 2005, ICML.

[4] Andrew G. Barto,et al. Automatic Discovery of Subgoals in Reinforcement Learning using Diverse Density , 2001, ICML.

[5] Verzekeren Naar Sparen,et al. Cambridge , 1969, Humphrey Burton: In My Own Time.

[6] Craig Boutilier,et al. Exploiting Structure in Policy Construction , 1995, IJCAI.

[7] Bhaskar Krishnamachari,et al. Communication and Computation in Distributed CSP Algorithms , 2002, CP.

[8] Jonathan Klein,et al. breve: a 3D environment for the simulation of decentralized systems and artificial life , 2002 .

[9] Thomas G. Dietterich. The MAXQ Method for Hierarchical Reinforcement Learning , 1998, ICML.

[10] Makoto Yokoo,et al. Weak-Commitment Search for Solving Constraint Satisfaction Problems , 1994, AAAI.

[11] Makoto Yokoo,et al. Distributed Constraint Satisfaction: Foundations of Cooperation in Multi-agent Systems , 2000 .

[12] Gary L. Drescher,et al. Made-up minds - a constructivist approach to artificial intelligence , 1991 .