6 results on '"Pavone, Marco"'
Search Results
2. Sample-efficient safety assurances using conformal prediction.
- Author
-
Luo, Rachel, Zhao, Shengjia, Kuck, Jonathan, Ivanovic, Boris, Savarese, Silvio, Schmerling, Edward, and Pavone, Marco
- Subjects
INFERENTIAL statistics ,ROBOTICS ,WARNINGS ,ROBOTS ,FORECASTING - Abstract
When deploying machine learning models in high-stakes robotics applications, the ability to detect unsafe situations is crucial. Early warning systems can provide alerts when an unsafe situation is imminent (in the absence of corrective action). To reliably improve safety, these warning systems should have a provable false negative rate; that is, of the situations that are unsafe, fewer than ϵ will occur without an alert. In this work, we present a framework that combines a statistical inference technique known as conformal prediction with a simulator of robot/environment dynamics, in order to tune warning systems to provably achieve an ϵ false negative rate using as few as 1/ ϵ data points. We apply our framework to a driver warning system and a robotic grasping application, and empirically demonstrate the guaranteed false negative rate while also observing a low false detection (positive) rate. [ABSTRACT FROM AUTHOR]
- Published
- 2024
- Full Text
- View/download PDF
3. Locomotion as manipulation with ReachBot.
- Author
-
Chen, Tony G., Newdick, Stephanie, Di, Julia, Bosio, Carlo, Ongole, Nitin, Lapôtre, Mathieu, Pavone, Marco, and Cutkosky, Mark R.
- Abstract
Caves and lava tubes on the Moon and Mars are sites of geological and astrobiological interest but consist of terrain that is inaccessible with traditional robot locomotion. To support the exploration of these sites, we present ReachBot, a robot that uses extendable booms as appendages to manipulate itself with respect to irregular rock surfaces. The booms terminate in grippers equipped with microspines and provide ReachBot with a large workspace, allowing it to achieve force closure in enclosed spaces, such as the walls of a lava tube. To propel ReachBot, we present a contact-before-motion planner for nongaited legged locomotion that uses internal force control, similar to a multifingered hand, to keep its long, slender booms in tension. Motion planning also depends on finding and executing secure grips on rock features. We used a Monte Carlo simulation to inform gripper design and predict grasp strength and variability. In addition, we used a two-step perception system to identify possible grasp locations. To validate our approach and mechanisms under realistic conditions, we deployed a single ReachBot arm and gripper in a lava tube in the Mojave Desert. The field test confirmed that ReachBot will find many targets for secure grasps with the proposed kinematic design. Editor's summary: Caves on the moon and Mars are of geological and astrobiological interest, but their rocky terrain and sparse anchor points make it impossible for traditional robots to explore. Taking inspiration from an arachnid, Chen et al. developed a robot with a small body and long extendable booms for appendages named ReachBot. The ends of the booms were equipped with grippers that can grasp rocky terrain and enable ReachBot to use manipulation for locomotion. Using onboard sensors along with a contact-before-motion planner, the robot could scan and identify graspable convex features. Field tests performed in a lava tube in the Mojave Desert (California, USA) confirmed that ReachBot could identify and grasp multiple sites, demonstrating its potential as a martian explorer. —Melisa Yashinski [ABSTRACT FROM AUTHOR]
- Published
- 2024
- Full Text
- View/download PDF
4. A COPOSITIVE FRAMEWORK FOR ANALYSIS OF HYBRID ISING-CLASSICAL ALGORITHMS.
- Author
-
BROWN, ROBIN, NEIRA, DAVID E. BERNAL, VENTURELLI, DAVIDE, and PAVONE, MARCO
- Subjects
OPTIMIZATION algorithms ,MATHEMATICAL reformulation ,POLYNOMIAL time algorithms ,ALGORITHMS ,NP-hard problems ,QUANTUM computers - Abstract
Recent years have seen significant advances in quantum/quantum-inspired technologies capable of approximately searching for the ground state of Ising spin Hamiltonians. The promise of leveraging such technologies to accelerate the solution of difficult optimization problems has spurred an increased interest in exploring methods to integrate Ising problems as part of their solution process, with existing approaches ranging from direct transcription to hybrid quantum- classical approaches rooted in existing optimization algorithms. While it is widely acknowledged that quantum computers should augment classical computers, rather than replace them entirely, comparatively little attention has been directed toward deriving analytical characterizations of their interactions. In this paper, we present a formal analysis of hybrid algorithms in the context of solving mixed-binary quadratic programs (MBQP) via Ising solvers. By leveraging an existing completely positive reformulation of MBQPs, as well as a new strong-duality result, we show the exactness of the dual problem over the cone of copositive matrices, thus allowing the resulting reformulation to inherit the straightforward analysis of convex optimization. We propose to solve this reformulation with a hybrid quantum-classical cutting-plane algorithm. Using existing complexity results for convex cutting-plane algorithms, we deduce that the classical portion of this hybrid framework is guaranteed to be polynomial time. This suggests that when applied to NP-hard problems, the complexity of the solution is shifted onto the subroutine handled by the Ising solver. [ABSTRACT FROM AUTHOR]
- Published
- 2024
- Full Text
- View/download PDF
5. The matroid team surviving orienteers problem and its variants: Constrained routing of heterogeneous teams with risky traversal.
- Author
-
Jorgensen, Stefan and Pavone, Marco
- Subjects
- *
POLYNOMIAL time algorithms , *MATROIDS , *ROBOTIC path planning , *ORIENTEERING , *ORIENTEERS , *GREEDY algorithms , *ROUTING algorithms - Abstract
Consider deploying a team of robots in order to visit sites in a risky environment (i.e., where a robot might be lost during a traversal), subject to team-based operational constraints such as limits on team composition, traffic throughputs, and launch constraints. We formalize this problem using a graph to represent the environment, enforcing probabilistic survival constraints for each robot, and using a matroid (which generalizes linear independence to sets) to capture the team-based operational constraints. The resulting "Matroid Team Surviving Orienteers" (MTSO) problem has broad applications for robotics such as informative path planning, resource delivery, and search and rescue. We demonstrate that the objective for the MTSO problem has submodular structure, which leads us to develop two polynomial time algorithms which are guaranteed to find a solution with value within a constant factor of the optimum. The second of our algorithms is an extension of the accelerated continuous greedy algorithm, and can be applied to much broader classes of constraints while maintaining bounds on suboptimality. In addition to in-depth analysis, we demonstrate the efficiency of our approaches by applying them to a scenario where a team of robots must gather information while avoiding dangers in the Coral Triangle and characterize scaling and parameter selection using a synthetic dataset. [ABSTRACT FROM AUTHOR]
- Published
- 2024
- Full Text
- View/download PDF
6. Bayesian Embeddings for Few-Shot Open World Recognition.
- Author
-
Willes J, Harrison J, Harakeh A, Finn C, Pavone M, and Waslander SL
- Abstract
As autonomous decision-making agents move from narrow operating environments to unstructured worlds, learning systems must move from a closed-world formulation to an open-world and few-shot setting in which agents continuously learn new classes from small amounts of information. This stands in stark contrast to modern machine learning systems that are typically designed with a known set of classes and a large number of examples for each class. In this work we extend embedding-based few-shot learning algorithms to the open-world recognition setting. We combine Bayesian non-parametric class priors with an embedding-based pre-training scheme to yield a highly flexible framework which we refer to as few-shot learning for open world recognition (FLOWR). We benchmark our framework on open-world extensions of the common MiniImageNet and TieredImageNet few-shot learning datasets. Our results show, compared to prior methods, strong classification accuracy performance and up to a 12% improvement in H-measure (a measure of novel class detection) from our non-parametric open-world few-shot learning scheme.
- Published
- 2024
- Full Text
- View/download PDF
Catalog
Discovery Service for Jio Institute Digital Library
For full access to our library's resources, please sign in.