Zobrazeno 1 - 10
of 66
pro vyhledávání: '"Marius Kloetzer"'
Publikováno v:
Applied Sciences, Vol 9, Iss 4, p 791 (2019)
This paper applies mathematical modeling and solution numerical evaluation to the problem of collecting a set of samples scattered throughout a graph environment and transporting them to a storage facility. A team of identical robots is available, wh
Externí odkaz:
https://doaj.org/article/9e8dd92da3e94e0497f113e69c67ced6
Publikováno v:
2022 26th International Conference on System Theory, Control and Computing (ICSTCC).
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::0fe414f39e68544bd73e9aa245fdad50
https://doi.org/10.1109/icstcc55426.2022.9931878
https://doi.org/10.1109/icstcc55426.2022.9931878
Publikováno v:
2022 IEEE 27th International Conference on Emerging Technologies and Factory Automation (ETFA).
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::d117d81240e8bb5fc4607de07f0efa9e
https://doi.org/10.1109/etfa52439.2022.9921482
https://doi.org/10.1109/etfa52439.2022.9921482
Publikováno v:
IFAC-PapersOnLine. 53:2063-2068
This paper considers the path planning problem in multirobot systems with an unknown environment. The robots’ mission is given as a Boolean formula on the final states. We assume that the robots have partial knowledge of the environment and they ar
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::bfbbd96d1b3f53a32a8e6dd51b70025a
https://doi.org/10.1016/j.ifacol.2020.12.2521
https://doi.org/10.1016/j.ifacol.2020.12.2521
This work achieves parallel movements and collision free paths for a team of identical robots evolving in a known environment while satisfying a global Boolean-based formula over a set of regions of interest. The movement capabilities of the robots w
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::6c8e9fae33180bb009259ef7d40f5424
http://zaguan.unizar.es/record/124038
http://zaguan.unizar.es/record/124038
Publikováno v:
ICSTCC
Significant topics for Unmanned Aerial Vehicle (UAV) flight are represented by path planning and task assignment in a 3D environment. In this paper we propose a mathematical formulation designed as a Mixed Integer Linear Programming (MILP) problem th
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::6ae225ec007ab1440061dcf7d8e91f8c
https://doi.org/10.1109/icstcc52150.2021.9606861
https://doi.org/10.1109/icstcc52150.2021.9606861
Publikováno v:
2021 26th IEEE International Conference on Emerging Technologies and Factory Automation (ETFA ).
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::198315bca4d5f087ddd4d066d187cbff
https://doi.org/10.1109/etfa45728.2021.9613218
https://doi.org/10.1109/etfa45728.2021.9613218
Publikováno v:
Path Planning of Cooperative Mobile Robots Using Discrete Event Models. :109-140
In this chapter, different path planning problems solved by using transition system models are presented. We start with the classical navigation problem for a single robot: given an environment cluttered with some obstacles, find a trajectory for a r
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::87cf343487ff6604cc6091943636c3e2
https://doi.org/10.1002/9781119486305.ch5
https://doi.org/10.1002/9781119486305.ch5
Autor:
Marius Kloetzer, Cristian Mahulea
Publikováno v:
Discrete Event Dynamic Systems. 30:55-79
This research proposes an automatic strategy for planning a team of identical robots evolving in a known environment. The robots should satisfy a global task for the whole team, given in terms of a Linear Temporal Logic (LTL) formula over predefined
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::1c3c0cd35d0290671b32b06e37c0cbcc
https://doi.org/10.1007/s10626-019-00300-1
https://doi.org/10.1007/s10626-019-00300-1
Publikováno v:
ICSTCC
A relevant problem in unmanned aerial vehicles flight is planning paths in 3D environments. The problem can be solved using different behaviour constraints and performance criteria. The goal of this work is to design a collision-free path that allows
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::598e4c3568882876314b053ff9eb0fdc
https://doi.org/10.1109/icstcc50638.2020.9259702
https://doi.org/10.1109/icstcc50638.2020.9259702