Author of the publication

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

 

Other publications of authors with the same name

Multiagent Connected Path Planning: PSPACE-Completeness and How to Deal With It., , , , and . AAAI, page 4735-4742. AAAI Press, (2018)Intractability of Time-Optimal Multirobot Path Planning on 2D Grid Graphs with Holes., , and . IEEE Robotics Autom. Lett., 2 (4): 1941-1947 (2017)A Journey Among Pairs of Vertices: Computing Robots' Paths for Performing Joint Measurements., , , , and . AAMAS, page 229-237. International Foundation for Autonomous Agents and Multiagent Systems Richland, SC, USA / ACM, (2018)Online Update of Communication Maps for Exploring Multirobot Systems Under Connectivity Constraints., , , , and . DARS, volume 9 of Springer Proceedings in Advanced Robotics, page 513-526. Springer, (2018)Approximating the Value of Collaborative Team Actions for Efficient Multiagent Navigation in Uncertain Graphs., , and . ICAPS, page 677-685. AAAI Press, (2023)Seeking Prevention of Cognitive Decline in Elders via Activity Suggestion by A Virtual Caregiver., , , , , , , and . AAMAS, page 1835-1837. International Foundation for Autonomous Agents and Multiagent Systems Richland, SC, USA / ACM, (2018)High-Level Path Planning in Hostile Dynamic Environments., and . AAMAS, page 1799-1801. International Foundation for Autonomous Agents and Multiagent Systems, (2019)Multirobot exploration for building communication maps with prior from communication models., , , , , , , and . MRS, page 90-96. IEEE, (2017)Asynchronous multirobot exploration under recurrent connectivity constraints., , , , and . ICRA, page 5491-5498. IEEE, (2016)An integer linear programming model for fair multitarget tracking in cooperative multirobot systems., , , , , , and . Auton. Robots, 43 (3): 665-680 (2019)