DisCSPs with Privacy Recast as Planning Problems for Utility-based Agents.
Julien SavauxJulien VionSylvain PiechowiakRené MandiauToshihiro MatsuiKatsutoshi HirayamaMakoto YokooShakre ElmaneMarius SilaghiPublished in: CoRR (2016)
Keyphrases
- planning problems
- solving planning problems
- distributed constraint satisfaction
- partial observability
- distributed constraint satisfaction problems
- heuristic search
- domain independent
- multi agent systems
- sensing actions
- multi agent
- state space
- ai planning
- multiagent systems
- constraint satisfaction
- planning domains
- planning systems
- intelligent agents
- distributed search
- concurrent actions
- probabilistic planning
- fully observable
- search algorithm
- multiple agents
- coalition formation
- decision theoretic
- distributed environment
- dynamic environments
- asynchronous backtracking
- causal graph
- planning graph
- situation calculus
- symbolic model checking
- constraint satisfaction problems
- classical planning
- binary decision diagrams
- orders of magnitude
- search space
- computational complexity