A branch-and-bound based globally optimal solution to 2D multi-robot relative pose estimation problems

DOI10.1016/J.AUTOMATICA.2024.111654zbMATH Open1537.93066MaRDI QIDQ6550249

Qing Li, Yiyang Liu, Heng Wang, Xinyu Zhao, Shoudong Huang

Publication date: 5 June 2024

Published in: Automatica (Search for Journal in Brave)

zbMATH Keywords

branch-and-boundglobally optimal solutionmulti-robot systemsrelative pose estimation

Mathematics Subject Classification ID

Automated systems (robots, etc.) in control theory (93C85) Multi-agent systems (93A16)

Cites Work

• Localizability and distributed protocols for bearing-based network localization in arbitrary dimensions
• Distributed localization with mixed measurements under switching topologies
• Comparison of two different objective functions in 2D point feature SLAM
• Exploiting submodularity to quantify near-optimality in multi-agent coverage problems
• Bearing-only distributed localization: a unified barycentric approach
• Pose localization of leader-follower networks with direction measurements
• Dimensionality reduction for point feature SLAM problems with spherical covariance matrices
• The nonlinearity structure of point feature SLAM problems with spherical covariance matrices
• Incremental Distributed Inference from Arbitrary Poses and Unknown Data Association: Using Collaborating Robots to Establish a Common Reference
• Branching and bounds tighteningtechniques for non-convex MINLP

This page was built for publication: A branch-and-bound based globally optimal solution to 2D multi-robot relative pose estimation problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6550249)