default search action
Paolo Bevilacqua
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
- [j12]Alessandro Antonucci, Paolo Bevilacqua, Stefano Leonardi, Luigi Palopoli, Daniele Fontanelli
:
Humans as path-finders for mobile robots using teach-by-showing navigation. Auton. Robots 47(8): 1255-1273 (2023) - [j11]Cristian Consonni
A new Markov-Dubins hybrid solver with learned decision trees. Eng. Appl. Artif. Intell. 122: 106166 (2023) - 2022
- [j10]Alessandro Antonucci
Efficient Prediction of Human Motion for Real-Time Robotics Applications With Physics-Inspired Neural Networks. IEEE Access 10: 144-157 (2022) - [j9]Manuel Boldrer
Multi-agent navigation in human-shared environments: A safe and socially-aware approach. Robotics Auton. Syst. 149: 103979 (2022) - 2021
- [j8]Manuel Boldrer
Graph Connectivity Control of a Mobile Robot Network With Mixed Dynamic Multi-Tasks. IEEE Robotics Autom. Lett. 6(2): 1934-1941 (2021) - [j7]Paolo Bevilacqua
Activity Planning for Assistive Robots Using Chance-Constrained Stochastic Programming. IEEE Trans. Ind. Informatics 17(6): 3950-3961 (2021) - [c7]Enrico Saccon
Robot Motion Planning: can GPUs be a Game Changer? COMPSAC 2021: 21-30 - [c6]Daniele Fontanelli
UWB Indoor Global Localisation for Nonholonomic Robots with Unknown Offset Compensation. ICRA 2021: 5795-5801 - [i1]Alessandro Antonucci, Paolo Bevilacqua, Stefano Leonardi, Luigi Palopoli, Daniele Fontanelli:
Humans as Path-Finders for Safe Navigation. CoRR abs/2107.03079 (2021) - 2020
- [j6]Enrico Bertolazzi, Paolo Bevilacqua
Efficient intersection between splines of clothoids. Math. Comput. Simul. 176: 57-72 (2020) - [j5]Marco Frego
An Iterative Dynamic Programming Approach to the Multipoint Markov-Dubins Problem. IEEE Robotics Autom. Lett. 5(2): 2483-2490 (2020) - [j4]Marco Frego
Minimum Time - Minimum Jerk Optimal Traffic Management for AGVs. IEEE Robotics Autom. Lett. 5(4): 5307-5314 (2020) - [c5]Paolo Bevilacqua, Marco Frego, Daniele Fontanelli
A novel formalisation of the Markov-Dubins problem. ECC 2020: 1987-1992
2010 – 2019
- 2019
- [b1]Paolo Bevilacqua:
Efficient Motion Planning for Wheeled Mobile Robotics. University of Trento, Italy, 2019 - [j3]Paolo Bevilacqua, Gianni Bosi
Pareto Optimality on Compact Spaces in a Preference-Based Setting under Incompleteness. Int. J. Uncertain. Fuzziness Knowl. Based Syst. 27(2): 239-249 (2019) - 2018
- [j2]Paolo Bevilacqua
Reactive Planning for Assistive Robots. IEEE Robotics Autom. Lett. 3(2): 1276-1283 (2018) - [c4]Enrico Bertolazzi
Efficient Re-planning for Robotic Cars. ECC 2018: 1068-1073 - [c3]Valerio Magnago, Paolo Bevilacqua
Optimal landmark placement for indoor positioning using context information and multi-sensor data. I2MTC 2018: 1-6 - 2017
- [j1]Paolo Bevilacqua
Existence of Order-Preserving Functions for Nontotal Fuzzy Preference Relations under Decisiveness. Axioms 6(4): 29 (2017) - 2016
- [c2]Paolo Bevilacqua
Path planning maximising human comfort for assistive robots. CCA 2016: 1421-1427 - [c1]Marco Frego
Trajectory planning for car-like vehicles: A modular approach. CDC 2016: 203-209
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 22:14 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: