Zobrazeno 1 - 10
of 47
pro vyhledávání: '"Nora Ayanian"'
Publikováno v:
Applied Sciences, Vol 11, Iss 7, p 3115 (2021)
Complex service robotics scenarios entail unpredictable task appearance both in space and time. This requires robots to continuously relocate and imposes a trade-off between motion costs and efficiency in task execution. In such scenarios, multi-robo
Externí odkaz:
https://doaj.org/article/77208d69f3264ddf9e0d8448dfb5ae92
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
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::6832441c8a74cdaab4c88c4fc9ea7221
https://doi.org/10.1109/lra.2019.2894217
https://doi.org/10.1109/lra.2019.2894217
Autor:
Nora Ayanian
Publikováno v:
The International Journal of Robotics Research. 38:1329-1337
This paper defines the research area of Diversity-enhanced Autonomy in Robot Teams (DART), a novel paradigm for the creation and design of policies for multi-robot coordination. Although current approaches to multi-robot coordination have been succes
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::97cccc0d761a0169079ed79a76bf4841
https://doi.org/10.1177/0278364919839137
https://doi.org/10.1177/0278364919839137
Autor:
Nora Ayanian, Elahe Aghapour
Publikováno v:
ICRA
We are interested in learning models of non-stationary environments, which can be framed as a multi-task learning problem. Model-free reinforcement learning algorithms can achieve good asymptotic performance in multi-task learning at a cost of extens
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::017ab1358018080faba622c82ee2a8eb
https://doi.org/10.1109/icra48506.2021.9561219
https://doi.org/10.1109/icra48506.2021.9561219
Publikováno v:
Proceedings of the International Symposium on Combinatorial Search. 10:190-191
The Multi-Agent Pickup and Delivery (MAPD) problem models applications where a large number of agents attend to a stream of incoming pickup-and-delivery tasks. Token Passing (TP) is a recent MAPD algorithm that is efficient and effective. We make TP
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::cfb83c9c30c3cad5e73eb01c926a7b31
https://doi.org/10.1609/socs.v10i1.18485
https://doi.org/10.1609/socs.v10i1.18485
Publikováno v:
Proceedings of the International Symposium on Combinatorial Search. 3:177-178
Multirobot path planning and task assignment are traditionally treated separately, however task assignment can greatly impact the difficulty of the path planning problem, and the ultimate quality of solution is dependent upon both. We introduce task
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::25a48653c08d3e17614b88c64508f95e
https://doi.org/10.1609/socs.v3i1.18261
https://doi.org/10.1609/socs.v3i1.18261
Publikováno v:
IROS
For multiple robots performing exploration in a previously unmapped environment, such as planetary exploration, maintaining accurate localization and building a consistent map are vital. If the robots do not have a map to localize against and do not
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::ba27ee87e9c4ac126d9342ae9fac9597
https://doi.org/10.1109/iros45743.2020.9341227
https://doi.org/10.1109/iros45743.2020.9341227
Publikováno v:
Autonomous Robots, 44(3-4), 297-298. Springer
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::e21894c758ce0b58db6eb4a97e895444
https://research.utwente.nl/en/publications/db753619-c3fb-4d68-b2a6-f263e5ad65b2
https://research.utwente.nl/en/publications/db753619-c3fb-4d68-b2a6-f263e5ad65b2
Publikováno v:
IEEE Transactions on Robotics. 34:856-869
We describe a method for multirobot trajectory planning in known, obstacle-rich environments. We demonstrate our approach on a quadrotor swarm navigating in a warehouse setting. Our method consists of following three stages: 1) roadmap generation tha
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::51de61cc713234b664809e88f8c44ef0
https://doi.org/10.1109/tro.2018.2853613
https://doi.org/10.1109/tro.2018.2853613
Publikováno v:
IEEE Transactions on Automation Science and Engineering. 15:852-862
This paper addresses combinatorial problems that arise in multirobot battery exchange systems. The multirobot battery exchange system addressed herein is characterized by two types of robots: task robots that provide services at requested locations a
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::89e667f5180ad15c476ea6594d07f4bd
https://doi.org/10.1109/tase.2017.2767379
https://doi.org/10.1109/tase.2017.2767379