Zobrazeno 1 - 10
of 15
pro vyhledávání: '"Basak Sakcak"'
Publikováno v:
Frontiers in Neurorobotics, Vol 16 (2022)
In this paper we start from the philosophical position in cognitive science known as enactivism. We formulate five basic enactivist tenets that we have carefully identified in the relevant literature as the main underlying principles of that philosop
Externí odkaz:
https://doaj.org/article/ef4ef96e65c24aee87413e806ef6c5b2
Publikováno v:
Algorithmic Foundations of Robotics XV ISBN: 9783031210891
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::1977ac3ba1c68ceec240a0226526fc7c
https://doi.org/10.1007/978-3-031-21090-7_16
https://doi.org/10.1007/978-3-031-21090-7_16
Publikováno v:
IEEE Control Systems Letters. 4:175-180
This letter introduces a new heuristic function that can be incorporated in any kinodynamic planner using motion primitives, to the purpose of increasing its convergence rate. The heuristic function is proven to be admissible and, hence, the optimali
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::2fd439b19b42a090728463a6e53df41b
https://doi.org/10.1109/lcsys.2019.2922166
https://doi.org/10.1109/lcsys.2019.2922166
Publikováno v:
IFAC-PapersOnLine. 53:15211-15216
This paper addresses the design of coordinated maneuvers in an autonomous driving set-up involving multiple vehicles. In particular, we consider a lane change problem where a vehicle has to merge in a platoon traveling in the adjacent lane of a two-l
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::4c8a878c62a7d813c9075f182619e18d
https://doi.org/10.1016/j.ifacol.2020.12.2302
https://doi.org/10.1016/j.ifacol.2020.12.2302
Autor:
Andrea Baraldo, Luca Bascetta, Fabrizio Caprotti, Sumit Chourasiya, Gianni Ferretti, Angelo Ponti, Basak Sakcak
Determining a feasible bending sequence, i.e., ensuring absence of wire self-collisions and wire-machine collisions, or even an optimal bending sequence, i.e., minimising time or energy required to perform it, is a difficult and time-consuming task f
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::50f83334c2d54c1e8825e96a59eb9f56
http://urn.fi/urn:nbn:fi-fe2023032733289
http://urn.fi/urn:nbn:fi-fe2023032733289
Publikováno v:
Autonomous Robots. 43:1715-1732
This paper proposes a novel sampling-based motion planner, which integrates in Rapidly exploring Random Tree star ( $$\hbox {RRT}^{\star }$$ ) a database of pre-computed motion primitives to alleviate its computational load and allow for motion plann
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::fcd555eee2e541126be4b73b1daaad1c
https://doi.org/10.1007/s10514-019-09830-x
https://doi.org/10.1007/s10514-019-09830-x
Autor:
Basak Sakcak, Steven M. LaValle
Publikováno v:
ICRA
This paper considers a fundamental, optimal path planning problem that requires simultaneously minimizing path length and maximizing obstacle clearance. We show that in even simple planar settings with point and disc obstacles, the set of alternative
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::7ca47a2ad13eb84b64532672702189ef
https://doi.org/10.1109/icra48506.2021.9561784
https://doi.org/10.1109/icra48506.2021.9561784
Autor:
Martin Huba, Edoardo Giancola, Hankun Zhang, Basak Sakcak, Pier Alessio Rizzardi, Alejandro Rey Yamhure
Publikováno v:
International Journal of Computational Methods and Experimental Measurements. 5:574-582
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::fc07fc65e91f6c2936041429a47a5490
https://doi.org/10.2495/cmem-v5-n4-574-582
https://doi.org/10.2495/cmem-v5-n4-574-582
Publikováno v:
ECC
This paper introduces a method for kinodynamic planning with homotopy class constraints, and proposes a homotopy class identifier that establishes a geometric relation between a trajectory and a union of convex partitions of the 2D robot workspace. T
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::d7cd4e9b5ed057bb6719f6e9b1859211
https://doi.org/10.23919/ecc.2019.8796259
https://doi.org/10.23919/ecc.2019.8796259