Finding optimal plans for multiple teams of robots through a mediator: A logic-based approach
From MaRDI portal
Publication:5398314
DOI10.1017/S1471068413000525zbMath1286.68406MaRDI QIDQ5398314
Esra Erdem, Zeynep G. Saribatur, Volkan Patoglu, Peter Schüller, Tansel Uras
Publication date: 27 February 2014
Published in: Theory and Practice of Logic Programming (Search for Journal in Brave)
Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Logic programming (68N17) Artificial intelligence for robotics (68T40)
Related Items (3)
Combining Answer Set Programming and domain heuristics for solving hard industrial problems (Application Paper) ⋮ Manipulation of Articulated Objects Using Dual-arm Robots via Answer Set Programming ⋮ Graph-based construction of minimal models
Cites Work
- Theory and algorithms for plan merging
- Answer set programming and plan generation
- Complexity, decidability and undecidability results for domain-independent planning
- Logic programs with stable model semantics as a constraint programming paradigm
- Generating Pareto Solutions in a Two-Party Setting: Constraint Proposal Methods
This page was built for publication: Finding optimal plans for multiple teams of robots through a mediator: A logic-based approach
