Zobrazeno 1 - 10
of 13
pro vyhledávání: '"Joseph W. Durham"'
Publikováno v:
2021 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS).
Publikováno v:
IEEE Robotics and Automation Letters. 4:1125-1131
Multi-agent path finding (MAPF) is a well-studied problem in artificial intelligence that can be solved quickly in practice when using simplified agent assumptions. However, real-world applications, such as warehouse automation, require physical robo
Multi-Agent Path Finding (MAPF) is the problem of moving a team of agents to their goal locations without collisions. In this paper, we study the lifelong variant of MAPF, where agents are constantly engaged with new goal locations, such as in large-
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::45728a50dbbcfe0b7f8d3b26ad371d33
Autor:
Joseph W. Durham, Jürgen Leitner, Ben Upcroft, Chris McCool, Lachlan Nicholson, Trung Pham, James Sergeant, Matthew Cooper, Adam W. Tow, Peter Corke, Ruben Mangels, Niko Sünderhauf, Markus Eich, Christopher Lehnert, Jake E. Dean, Fangyi Zhang, Liao Wu, Peter T. Kujala
Publikováno v:
ICRA
Robotic challenges like the Amazon Picking Challenge (APC) or the DARPA Challenges are an established and important way to drive scientific progress. They make research comparable on a well-defined benchmark with equal test conditions for all partici
Publikováno v:
IEEE transactions on control of network systems, 3(1), 24-33. IEEE Control Systems Society
We propose algorithms to automatically deploy a group of mobile robots and provide coverage of a non-convex environment with communication limitations. In settings such as hilly terrain or for underwater ocean gliders, peer-to-peer communication can
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::c69ffb20cb5c64a98513e9384594e982
http://hdl.handle.net/11577/3192628
http://hdl.handle.net/11577/3192628
Publikováno v:
IEEE Transactions on Robotics. 28:1181-1188
This paper focuses on the problem of patrolling an environment with a team of autonomous agents. Given a set of strategically important locations (viewpoints) with different priorities, our patrolling strategy consists of 1) constructing a tour throu
Publikováno v:
CDC/ECC
We propose algorithms to automatically deploy a group of mobile robots to provide coverage of a non-convex environment with communication limitations. In settings such as hilly terrain or for underwater ocean gliders, peer-to-peer communication can b
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::6661d12dfeb648a89cec827899892e53
http://hdl.handle.net/11577/2532231
http://hdl.handle.net/11577/2532231
Publikováno v:
CDC
We propose distributed algorithms to automatically deploy a group of robotic agents and provide coverage of a discretized environment represented by a graph. The classic Lloyd approach to coverage optimization involves separate centering and partitio
Publikováno v:
2010 IEEE International Conference on Robotics and Automation (ICRA 2010)
ICRA
ICRA
This paper addresses a novel visibility-based pursuit-evasion problem in which a team of searchers with limited range sensors must coordinate to clear any evaders from an unknown planar environment. We present a distributed algorithm built around gua
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::eef917354be0c0c8956538f532fa6d51
https://hdl.handle.net/11858/00-001M-0000-0013-C03E-E
https://hdl.handle.net/11858/00-001M-0000-0013-C03E-E
We propose distributed algorithms to automatically deploy a team of mobile robots to partition and provide coverage of a non-convex environment. To handle arbitrary non-convex environments, we represent them as graphs. Our partitioning and coverage a
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::4f5628d69dcf145193ec523ff4f6322d