Zobrazeno 1 - 6
of 6
pro vyhledávání: '"Walaaeldin Ghadiry"'
Publikováno v:
IEEE Systems Journal. 15:466-477
In this article, patrolling with Dubins’ vehicles is investigated. The vehicles have significant kinematic constraints such as minimum-turning radius, and are unable to move in a reverse direction, i.e., they can only track planar curvature-bounded
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::e2e741e396b351107f33b9917bc635cd
https://doi.org/10.1109/jsyst.2020.3006990
https://doi.org/10.1109/jsyst.2020.3006990
Publikováno v:
IET Control Theory & Applications. 14:1401-1410
In this study, three general formulations are presented for trajectory optimisation in patrolling problems. In the traditional patrolling problem, some basic assumptions are made (often implicitly). For example, it is known how many robots and how ma
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::760d94b6325a16b975a14dbc7db589ff
https://doi.org/10.1049/iet-cta.2019.0281
https://doi.org/10.1049/iet-cta.2019.0281
Publikováno v:
Journal of Intelligent & Robotic Systems. 87:699-710
In this paper, two new formulations are presented for trajectory optimization in the patrolling problem. It is assumed that the starting depot is not prespecified; an assumption that distinguishes the present work from the existing literature. A numb
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::b7967a57b3646c07ba0032d4f47c36d7
https://doi.org/10.1007/s10846-017-0496-7
https://doi.org/10.1007/s10846-017-0496-7
Publikováno v:
2016 World Automation Congress (WAC).
This paper aims to tackle the patrolling problem using Dubins' vehicles. Such vehicles are known to have significant kinematic constraints such as minimum-turning radius and the inability to move backward. In other words, they can only track planar c
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::1c76ec9b9357477c05ae91e1d83e8e1d
https://doi.org/10.1109/wac.2016.7582988
https://doi.org/10.1109/wac.2016.7582988
Publikováno v:
MED
Two new formulations are presented in this paper for the minimum-time trajectories in the patrolling problem, where a number of robots are desired to patrol a given set of viewpoints in the shortest possible time. In the first problem, it is assumed
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::26ddf49991e769fa6eb81fe3a3fb9a6b
https://doi.org/10.1109/med.2016.7535977
https://doi.org/10.1109/med.2016.7535977
Publikováno v:
CCECE
In this paper, a general formulation is presented for trajectory optimization in patrolling problems. It is assumed that the starting depots are not prespecified. This assumption distinguishes the present work from the existing literature. A number o
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::e6de7ee423505d10998114a63c5bd8a7
https://doi.org/10.1109/ccece.2015.7129191
https://doi.org/10.1109/ccece.2015.7129191