A branch-and-bound based globally optimal solution to 2D multi-robot relative pose estimation problems
From MaRDI portal
Publication:6550249
Recommendations
- A sufficient condition of optimality for the relative pose problem between cameras
- A tighter relaxation for the relative pose problem between cameras
- Global Optimization for 2D SLAM Problem
- Global optimization through rotation space search
- Minimizing the object space error for pose estimation: towards the most efficient algorithm
Cites work
- Bearing-only distributed localization: a unified barycentric approach
- Branching and bounds tighteningtechniques for non-convex MINLP
- Comparison of two different objective functions in 2D point feature SLAM
- Dimensionality reduction for point feature SLAM problems with spherical covariance matrices
- Distributed localization with mixed measurements under switching topologies
- Exploiting submodularity to quantify near-optimality in multi-agent coverage problems
- Incremental Distributed Inference from Arbitrary Poses and Unknown Data Association: Using Collaborating Robots to Establish a Common Reference
- Localizability and distributed protocols for bearing-based network localization in arbitrary dimensions
- Pose localization of leader-follower networks with direction measurements
- The nonlinearity structure of point feature SLAM problems with spherical covariance matrices
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)
