default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMattia Laurini
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2024
[j10]Marco Milanesi
, Luca Consolini, Giulia Di Credico, Nicola Latronico, Mattia Laurini, Massimiliano Paltenghi, Michele Schiavo, Antonio Visioli:
Human-Imitating Control of Depth of Hypnosis Combining MPC and Event-Based PID Strategies. IEEE Control. Syst. Lett. 8: 580-585 (2024)- [j9]Luca Consolini, Mattia Laurini, Marco Locatelli:
A Dynamic Programming Approach for Cooperative Pallet-Loading Manipulators. IEEE Trans Autom. Sci. Eng. 21(4): 5280-5296 (2024) - 2023
- [j8]Stefano Ardizzoni, Luca Consolini, Mattia Laurini, Marco Locatelli:
Solution Algorithms for the Bounded Acceleration Shortest Path Problem. IEEE Trans. Autom. Control. 68(3): 1910-1917 (2023) - 2022
- [j7]Stefano Ardizzoni, Luca Consolini, Mattia Laurini, Marco Locatelli:
Shortest path with acceleration constraints: complexity and approximation algorithms. Comput. Optim. Appl. 83(2): 555-592 (2022) - 2021
- [j6]Michele Schiavo, Luca Consolini, Mattia Laurini, Nicola Latronico, Massimiliano Paltenghi, Antonio Visioli:
Optimized feedforward control of propofol for induction of hypnosis in general anesthesia. Biomed. Signal Process. Control. 66: 102476 (2021) - [j5]Mattia Laurini, Luca Consolini, Marco Locatelli:
Optimizing Cooperative Pallet Loading Robots: A Mixed Integer Approach. IEEE Robotics Autom. Lett. 6(3): 5300-5307 (2021) - [j4]Mattia Laurini, Luca Consolini, Marco Locatelli:
A Graph-Based Algorithm for Optimal Control of Switched Systems: An Application to Car Parking. IEEE Trans. Autom. Control. 66(12): 6049-6055 (2021) - 2020
- [j3]Luca Consolini, Mattia Laurini, Marco Locatelli, Andrea Minari:
A solution of the minimum-time speed planning problem based on lattice theory. J. Frankl. Inst. 357(12): 7617-7637 (2020) - [j2]Luca Consolini, Mattia Laurini, Marco Locatelli, Federico Cabassi:
Convergence Analysis of Spatial-Sampling-Based Algorithms for Time-Optimal Smooth Velocity Planning. J. Optim. Theory Appl. 184(3): 1083-1108 (2020) - 2019
- [j1]Luca Consolini, Mattia Laurini, Marco Locatelli:
Graph-based algorithms for the efficient solution of optimization problems involving monotone functions. Comput. Optim. Appl. 73(1): 101-128 (2019)
Conference and Workshop Papers
- 2024
- [c6]Luca Consolini, Mattia Laurini, Aurelio Piazzi:
Generalized Bang-Bang Control for Multivariable Feedforward Regulation. MED 2024: 506-511 - 2021
- [c5]Stefano Ardizzoni, Luca Consolini, Mattia Laurini, Marco Locatelli:
Efficient solution algorithms for the Bounded Acceleration Shortest Path problem. CDC 2021: 5729-5734 - [c4]Michele Schiavo, Luca Consolini, Mattia Laurini, Nicola Latronico, Massimiliano Paltenghi, Antonio Visioli:
Optimized robust combined feedforward/feedback control of propofol for induction of hypnosis in general anesthesia. SMC 2021: 1266-1271 - 2020
- [c3]Mattia Laurini, Luca Consolini, Marco Locatelli:
Fast numerical solution of optimal control problems for switched systems: An application to path planning. CDC 2020: 4105-4110 - 2018
- [c2]Mattia Laurini, Luca Consolini, Marco Locatelli:
A Multigraph-Based Selective Update Method for the Efficient Solution of Dynamic Programming. CDC 2018: 5916-5921 - 2016
- [c1]Mattia Laurini, Piero Micelli, Luca Consolini, Marco Locatelli:
A Jacobi-like acceleration for dynamic programming. CDC 2016: 7371-7376
Informal and Other Publications
- 2024
- [i4]Giulia Di Credico, Luca Consolini, Mattia Laurini, Marco Locatelli, Marco Milanesi, Michele Schiavo, Antonio Visioli:
A Branch and Bound method for the exact parameter identification of the PK/PD model for anesthetic drugs. CoRR abs/2403.16742 (2024) - [i3]Mattia Laurini, Irene Saccani, Stefano Ardizzoni, Luca Consolini, Marco Locatelli:
A Dynamic Programming Approach for Road Traffic Estimation. CoRR abs/2403.18561 (2024) - 2021
- [i2]Stefano Ardizzoni, Luca Consolini, Mattia Laurini, Marco Locatelli:
The Bounded Acceleration Shortest Path problem: complexity and solution algorithms. CoRR abs/2103.02914 (2021) - 2019
- [i1]Luca Consolini, Mattia Laurini, Marco Locatelli, Dario Lodi Rizzini:
Globally Optimal Registration based on Fast Branch and Bound. CoRR abs/1901.09641 (2019)
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 21: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:
