default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJacopo Banfi
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j14]Felix Herrmann, Sebastian Zach, Jacopo Banfi, Jan Peters, Georgia Chalvatzaki, Davide Tateo:
Safe and Efficient Path Planning Under Uncertainty via Deep Collision Probability Fields. IEEE Robotics Autom. Lett. 9(11): 9327-9334 (2024)- [i9]Felix Herrmann, Sebastian Zach, Jacopo Banfi, Jan Peters, Georgia Chalvatzaki, Davide Tateo:
Safe and Efficient Path Planning under Uncertainty via Deep Collision Probability Fields. CoRR abs/2409.04306 (2024) - 2023
- [c21]Martina Stadler, Jacopo Banfi, Nicholas Roy:
Approximating the Value of Collaborative Team Actions for Efficient Multiagent Navigation in Uncertain Graphs. ICAPS 2023: 677-685 - [c20]Andrew Messing, Jacopo Banfi, Martina Stadler, Ethan Stump, Harish Ravichandar, Nicholas Roy, Seth Hutchinson:
A Sampling-Based Approach for Heterogeneous Coalition Scheduling with Temporal Uncertainty. Robotics: Science and Systems 2023 - [i8]Brian H. Wang, Beatriz A. Asfora, Rachel Zheng, Aaron Peng, Jacopo Banfi, Mark E. Campbell:
Multiple-Hypothesis Path Planning with Uncertain Object Detections. CoRR abs/2308.07420 (2023) - 2022
- [j13]Jacopo Banfi
, Andrew Messing, Christopher M. Kroninger, Ethan Stump, Seth Hutchinson, Nicholas Roy:
Hierarchical Planning for Heterogeneous Multi-Robot Routing Problems via Learned Subteam Performance. IEEE Robotics Autom. Lett. 7(2): 4464-4471 (2022) - [c19]Jacopo Banfi, Lindsey Woo, Mark Campbell:
Is it Worth to Reason about Uncertainty in Occupancy Grid Maps during Path Planning? ICRA 2022: 11102-11108 - [c18]Vikram Shree, Sarah Allen, Beatriz A. Asfora, Jacopo Banfi, Mark E. Campbell:
Learning to Assess Danger from Movies for Cooperative Escape Planning in Hazardous Environments. IROS 2022: 5885-5892 - [i7]Jacopo Banfi, Lindsey Woo, Mark Campbell:
Is it Worth to Reason about Uncertainty in Occupancy Grid Maps during Path Planning? CoRR abs/2205.14251 (2022) - [i6]Vikram Shree, Sarah Allen, Beatriz A. Asfora, Jacopo Banfi, Mark E. Campbell:
Learning to Assess Danger from Movies for Cooperative Escape Planning in Hazardous Environments. CoRR abs/2207.13791 (2022) - 2021
- [j12]Vikram Shree, Beatriz A. Asfora, Rachel Zheng, Samantha Hong, Jacopo Banfi, Mark Campbell:
Exploiting Natural Language for Efficient Risk-Aware Multi-Robot SaR Planning. IEEE Robotics Autom. Lett. 6(2): 3152-3159 (2021) - [c17]Brian H. Wang, Carlos Diaz-Ruiz, Jacopo Banfi, Mark E. Campbell:
Detecting and Mapping Trees in Unstructured Environments with a Stereo Camera and Pseudo-Lidar. ICRA 2021: 14120-14126 - [i5]Brian H. Wang, Carlos Diaz-Ruiz, Jacopo Banfi, Mark E. Campbell:
Detecting and Mapping Trees in Unstructured Environments with a Stereo Camera and Pseudo-Lidar. CoRR abs/2103.15967 (2021) - [i4]Vikram Shree, Beatriz A. Asfora, Rachel Zheng, Samantha Hong, Jacopo Banfi, Mark E. Campbell:
Exploiting Natural Language for Efficient Risk-Aware Multi-robot SaR Planning. CoRR abs/2104.03809 (2021) - 2020
- [j11]Alberto Quattrini Li, Phani Krishna Penumarthi, Jacopo Banfi, Nicola Basilico, Jason M. O'Kane, Ioannis M. Rekleitis, Srihari Nelakuditi, Francesco Amigoni:
Multi-robot online sensing strategies for the construction of communication maps. Auton. Robots 44(3-4): 299-319 (2020) - [j10]Jacopo Banfi, Vikram Shree, Mark E. Campbell:
Planning High-Level Paths in Hostile, Dynamic, and Uncertain Environments. J. Artif. Intell. Res. 69: 297-342 (2020) - [j9]Beatriz A. Asfora, Jacopo Banfi, Mark E. Campbell:
Mixed-Integer Linear Programming Models for Multi-Robot Non-Adversarial Search. IEEE Robotics Autom. Lett. 5(4): 6805-6812 (2020) - [j8]Jacopo Banfi, Yizhou Zhang, G. Edward Suh, Andrew C. Myers, Mark E. Campbell:
Path Planning Under Malicious Injections and Removals of Perceived Obstacles: A Probabilistic Programming Approach. IEEE Robotics Autom. Lett. 5(4): 6884-6891 (2020) - [c16]Yutao Han, Jacopo Banfi, Mark Campbell:
Planning Paths Through Unknown Space by Imagining What Lies Therein. CoRL 2020: 905-914 - [c15]Yutao Han, Hubert Lin, Jacopo Banfi, Kavita Bala, Mark E. Campbell:
DeepSemanticHPPC: Hypothesis-based Planning over Uncertain Semantic Point Clouds. ICRA 2020: 4252-4258 - [i3]Yutao Han, Hubert Lin, Jacopo Banfi, Kavita Bala, Mark E. Campbell:
DeepSemanticHPPC: Hypothesis-based Planning over Uncertain Semantic Point Clouds. CoRR abs/2003.03464 (2020) - [i2]Yutao Han, Jacopo Banfi, Mark E. Campbell:
Planning Paths Through Unknown Space by Imagining What Lies Therein. CoRR abs/2011.07316 (2020) - [i1]Beatriz A. Asfora, Jacopo Banfi, Mark Campbell:
Mixed-Integer Linear Programming Models for Multi-Robot Non-Adversarial Search. CoRR abs/2011.12480 (2020)
2010 – 2019
- 2019
- [j7]Jacopo Banfi, Jérôme Guzzi, Francesco Amigoni, Eduardo Feo Flushing, Alessandro Giusti, Luca Maria Gambardella, Gianni A. Di Caro:
An integer linear programming model for fair multitarget tracking in cooperative multirobot systems. Auton. Robots 43(3): 665-680 (2019) - [j6]Jacopo Banfi:
Recent advances in multirobot exploration of communication-restricted environments. Intelligenza Artificiale 13(2): 203-230 (2019) - [j5]Alessandro Riva, Arlind Rufi, Jacopo Banfi, Francesco Amigoni:
Algorithms for limited-buffer shortest path problems in communication-restricted environments. Robotics Auton. Syst. 119: 221-230 (2019) - [c14]Jacopo Banfi, Mark E. Campbell:
High-Level Path Planning in Hostile Dynamic Environments. AAMAS 2019: 1799-1801 - 2018
- [b1]Jacopo Banfi:
Multirobot exploration of communication-restricted environments. Polytechnic University of Milan, Italy, 2018 - [j4]Jacopo Banfi, Alberto Quattrini Li, Ioannis M. Rekleitis, Francesco Amigoni, Nicola Basilico:
Strategies for coordinated multirobot exploration with recurrent connectivity constraints. Auton. Robots 42(4): 875-894 (2018) - [j3]Jacopo Banfi, Nicola Basilico, Francesco Amigoni:
Multirobot Reconnection on Graphs: Problem, Complexity, and Algorithms. IEEE Trans. Robotics 34(5): 1299-1314 (2018) - [c13]Davide Tateo, Jacopo Banfi, Alessandro Riva, Francesco Amigoni, Andrea Bonarini:
Multiagent Connected Path Planning: PSPACE-Completeness and How to Deal With It. AAAI 2018: 4735-4742 - [c12]Alessandro Riva, Jacopo Banfi, Carlo Fanton, Nicola Basilico, Francesco Amigoni:
A Journey Among Pairs of Vertices: Computing Robots' Paths for Performing Joint Measurements. AAMAS 2018: 229-237 - [c11]Alessandro Vuono, Matteo Luperto, Jacopo Banfi, Nicola Basilico, Nunzio Alberto Borghese, Michael Sioutis, Jennifer Renoux, Amy Loutfi:
Seeking Prevention of Cognitive Decline in Elders via Activity Suggestion by A Virtual Caregiver. AAMAS 2018: 1835-1837 - [c10]Francesco Amigoni, Jacopo Banfi, Nicola Basilico, Ioannis M. Rekleitis, Alberto Quattrini Li:
Online Update of Communication Maps for Exploring Multirobot Systems Under Connectivity Constraints. DARS 2018: 513-526 - [c9]Jacopo Banfi, Nicola Basilico, Stefano Carpin:
Optimal Redeployment of Multirobot Teams for Communication Maintenance. IROS 2018: 3757-3764 - 2017
- [j2]Francesco Amigoni, Jacopo Banfi, Nicola Basilico:
Multirobot Exploration of Communication-Restricted Environments: A Survey. IEEE Intell. Syst. 32(6): 48-57 (2017) - [j1]Jacopo Banfi, Nicola Basilico, Francesco Amigoni:
Intractability of Time-Optimal Multirobot Path Planning on 2D Grid Graphs with Holes. IEEE Robotics Autom. Lett. 2(4): 1941-1947 (2017) - [c8]Francesco Amigoni, Jacopo Banfi, Alessandro Longoni, Matteo Luperto:
Online switch of communication modalities for efficient multirobot exploration. ECMR 2017: 1-6 - [c7]Alessandro Riva, Jacopo Banfi, Arlind Rufi, Francesco Amigoni:
Algorithms for limited-buffer shortest path problems in communication-restricted environments. ECMR 2017: 1-6 - [c6]Jacopo Banfi, Alberto Quattrini Li, Nicola Basilico, Ioannis M. Rekleitis, Francesco Amigoni:
Multirobot online construction of communication maps. ICRA 2017: 2577-2583 - [c5]Phani Krishna Penumarthi, Alberto Quattrini Li, Jacopo Banfi, Nicola Basilico, Francesco Amigoni, Jason M. O'Kane, Ioannis M. Rekleitis, Srihari Nelakuditi:
Multirobot exploration for building communication maps with prior from communication models. MRS 2017: 90-96 - 2016
- [c4]Marta Romeo, Jacopo Banfi, Nicola Basilico, Francesco Amigoni:
Multirobot Persistent Patrolling in Communication-Restricted Environments. DARS 2016: 59-71 - [c3]Jacopo Banfi, Alberto Quattrini Li, Nicola Basilico, Ioannis M. Rekleitis, Francesco Amigoni:
Asynchronous multirobot exploration under recurrent connectivity constraints. ICRA 2016: 5491-5498 - 2015
- [c2]Jacopo Banfi, Jerome Guzzi, Alessandro Giusti, Luca Maria Gambardella, Gianni A. Di Caro:
Fair Multi-Target Tracking in Cooperative Multi-Robot systems. ICRA 2015: 5411-5418 - [c1]Jacopo Banfi, Nicola Basilico, Francesco Amigoni:
Minimizing communication latency in multirobot situation-aware patrolling. IROS 2015: 616-622
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:34 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:
