default search action
Marco Frego
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j16]Mattia Piazza
, Enrico Bertolazzi
A Non-Smooth Numerical Optimization Approach to the Three-Point Dubins Problem (3PDP). Algorithms 17(8): 350 (2024) - [j15]Marco Frego
Volume-Preserving Shear Transformation of an Elliptical Slant Cone to a Right Cone. Axioms 13(4): 245 (2024) - [j14]Filip Dyba
Non-Orthogonal Serret-Frenet Parametrization Applied to Path Following of B-Spline Curves by a Mobile Manipulator. Robotics 13(9): 139 (2024) - [i4]Michele Focchi, Andrea Del Prete, Daniele Fontanelli, Marco Frego, Angelika Peer, Luigi Palopoli:
ALPINE: a climbing robot for operations in mountain environments. CoRR abs/2403.15142 (2024) - [i3]Patrick Pastorelli, Simone Dagnino, Enrico Saccon, Marco Frego, Luigi Palopoli:
Fast Shortest Path Polyline Smoothing With G1 Continuity and Bounded Curvature. CoRR abs/2409.09816 (2024) - 2023
- [j13]Luigi Palopoli, Daniele Fontanelli
A Markovian model for the spread of the SARS-CoV-2 virus. Autom. 151: 110921 (2023) - [j12]Cristian Consonni
A new Markov-Dubins hybrid solver with learned decision trees. Eng. Appl. Artif. Intell. 122: 106166 (2023) - [c13]Hoomaan Moradimaryamnegari, Marco Frego, Angelika Peer:
Data-Driven Model Predictive Control Using Deep Double Expected Sarsa. CoDIT 2023: 345-350 - [c12]Seyed Mohsen Hosseini, Seif-El-Isalm Hasseni, Marco Frego, Angelika Peer:
Improving Wood Yield Recovery in Live Sawing Using Strip-bottom-left-fill Bin-packing Heuristic. ETFA 2023: 1-8 - [c11]Michele Focchi, Mohamed Bensaadallah, Marco Frego, Angelika Peer, Daniele Fontanelli
CLIO: a Novel Robotic Solution for Exploration and Rescue Missions in Hostile Mountain Environments. ICRA 2023: 7742-7748 - [c10]Hoomaan Moradimaryamnegari, Marco Frego, Angelika Peer:
Learning-Based Model Predictive Control Using Double Q-Learning. ICSTCC 2023: 349-355 - [c9]Seyed Mohsen Hosseini, Marco Frego, Angelika Peer:
Cutting Unequal Rectangular Boards from Cylindrical Logs in Wood Products Manufacturing: A Heuristic Approach. MED 2023: 946-953 - 2022
- [j11]Hoomaan Moradimaryamnegari
Model Predictive Control-Based Reinforcement Learning Using Expected Sarsa. IEEE Access 10: 81177-81191 (2022) - [j10]Marco Frego:
Closed form parametrisation of 3D clothoids by arclength with both linear varying curvature and torsion. Appl. Math. Comput. 421: 126907 (2022) - [i2]Luigi Palopoli, Daniele Fontanelli, Marco Frego, Marco Roveri:
A Markovian Model for the Spread of the SARS-CoV-2 Virus. CoRR abs/2204.11317 (2022) - [i1]Michele Focchi, Mohamed Bensaadallah, Marco Frego, Angelika Peer, Daniele Fontanelli, Andrea Del Prete, Luigi Palopoli:
CLIO: a Novel Robotic Solution for Exploration and Rescue Missions in Hostile Mountain Environments. CoRR abs/2209.09693 (2022) - 2021
- [j9]Paolo Bevilacqua
Activity Planning for Assistive Robots Using Chance-Constrained Stochastic Programming. IEEE Trans. Ind. Informatics 17(6): 3950-3961 (2021) - [c8]Enrico Saccon
Robot Motion Planning: can GPUs be a Game Changer? COMPSAC 2021: 21-30 - 2020
- [j8]Enrico Bertolazzi, Marco Frego
Point data reconstruction and smoothing using cubic splines and clusterization. Math. Comput. Simul. 176: 36-56 (2020) - [j7]Enrico Bertolazzi, Paolo Bevilacqua
Efficient intersection between splines of clothoids. Math. Comput. Simul. 176: 57-72 (2020) - [j6]Marco Frego
An Iterative Dynamic Programming Approach to the Multipoint Markov-Dubins Problem. IEEE Robotics Autom. Lett. 5(2): 2483-2490 (2020) - [j5]Marco Frego
Minimum Time - Minimum Jerk Optimal Traffic Management for AGVs. IEEE Robotics Autom. Lett. 5(4): 5307-5314 (2020) - [c7]Paolo Bevilacqua, Marco Frego, Daniele Fontanelli
A novel formalisation of the Markov-Dubins problem. ECC 2020: 1987-1992
2010 – 2019
- 2019
- [j4]Marco Frego, Enrico Bertolazzi
Point-Clothoid Distance and Projection Computation. SIAM J. Sci. Comput. 41(5): A3326-A3353 (2019) - 2018
- [j3]Enrico Bertolazzi
On the G2 Hermite Interpolation Problem with clothoids. J. Comput. Appl. Math. 341: 99-116 (2018) - [j2]Paolo Bevilacqua
Reactive Planning for Assistive Robots. IEEE Robotics Autom. Lett. 3(2): 1276-1283 (2018) - [c6]Marco Frego
On the Distance between a Point and a Clothoid Curve. ECC 2018: 1-6 - [c5]Enrico Bertolazzi
Efficient Re-planning for Robotic Cars. ECC 2018: 1068-1073 - 2017
- [j1]Marco Frego
Semi-analytical minimum time solutions with velocity constraints for trajectory following of vehicles. Autom. 86: 18-28 (2017) - [c4]Marco Frego
On the Probability of Incorrect Decoding for Linear Codes. IMACC 2017: 103-115 - 2016
- [c3]Paolo Bevilacqua
Path planning maximising human comfort for assistive robots. CCA 2016: 1421-1427 - [c2]Marco Frego
Trajectory planning for car-like vehicles: A modular approach. CDC 2016: 203-209 - [c1]Marco Frego
Semi-analytical minimum time solutions for a vehicle following clothoid-based trajectory subject to velocity constraints. ECC 2016: 2221-2227
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-11-07 20:31 CET 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: