Connectivity Graph Construction

Connectivity Graph Construction is a method in computational robotics that, within the framework of cell decomposition or probabilistic roadmaps, generates a graph representation of the connectivity of free space by nodes corresponding to cells or sampled configurations and edges representing feasible transitions between them.

123

Publications

4.8K

Citations

341

Authors

188

Institutions

Publications per year

2017–2026

24

Authors

341

  1. CG
    Craig Gotsman

    Technion – Israel Institute of Technology, Israel

    4 publications · 114 citations

    4

    h-index

  2. SG
    Stefan Gumhold

    Technische Universität Dresden, Germany

    3 publications · 74 citations

    3

    h-index

  3. MI
    Martin Isenburg

    University of North Carolina at Chapel Hill, United States

    3 publications · 74 citations

    3

    h-index

  4. AS
    Alla Safonova

    Carnegie Mellon University, United States

    2 publications · 91 citations

    2

    h-index

  5. MH
    Monika Henzinger

    University of Vienna, Austria

    2 publications · 150 citations

    2

    h-index

1–5 of 341

Venues

  1. IEEE Transactions on Robotics and Automation

    3 publications · 297 citations

    3

    h-index

  2. 2

    h-index

  3. Information and Computation

    2 publications · 49 citations

    2

    h-index

  4. Discrete Applied Mathematics

    2 publications · 63 citations

    2

    h-index

  5. Robotics and Autonomous Systems

    2 publications · 47 citations

    2

    h-index

1–5