Optimizing pathfinding for goal legibility and recognition in cooperative partially observable environments

DOI10.1016/J.ARTINT.2024.104148MaRDI QIDQ6579304zbMATH OpenFDO

Authors Sara Bernardini, Fabio Fagnani, Alexandra Neacsu, Santiago Franco

Publication date 25 July 2024

Published in Artificial Intelligence (Search for Journal in Brave)

zbMATH Keywords

reformulationpartial observabilityflow networkspathfindinggoal recognitionmulti-agent path planninggoal legibilityinterpretable agent behavior

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Agent technology and artificial intelligence (68T42)

Recommendations

• SOLVING ABSTRACT COOPERATIVE PATH-FINDING IN DENSELY POPULATED ENVIRONMENTS
• scientific article; zbMATH DE number 1630132
• A POMDP framework for coordinated guidance of autonomous UAVs for multitarget tracking
• Time-expanded graph-based propositional encodings for makespan-optimal solving of cooperative path finding problems
• A decentralized partially observable Markov decision model with action duration for goal recognition in real time strategy games

Cites work

• Cost-based goal recognition in navigational domains
• Expecting the unexpected: goal recognition for rational and irrational agents
• Game-theoretic goal recognition models with applications to security domains
• Goal recognition design in deterministic environments
• Goal recognition through goal graph analysis
• Maximal Flow Through a Network

This page was built for publication: Optimizing pathfinding for goal legibility and recognition in cooperative partially observable environments

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6579304)