Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Discrete Configuration Complex #65

Open
wants to merge 11 commits into
base: main
Choose a base branch
from

Conversation

theo-long
Copy link

Given a graph $G$, the Discrete Configuration Complex $D_k(G)$ is the set of all $k$-tuples of edges and vertices in $G$ which form a legal configuration. A legal configuration is one in which none of the vertices or edges in the configuration are incident to one and other - for example, no two edges share a vertex, and no vertex in a configuration is also contained in an edge.

This is an example of a cube complex - a topological space constructed entirely from unions of hypercubes. It was originally constructed by Abrams [3] and used to represent robot motion planning problems, where the k tuple represents k different robots and the complex captures how the robots can move around without colliding into each other. See [1], [2], [3], and [4] for a more detailed explanation.

Unfortunately, since TopoNetX does not support cell complexes of dimensions > 2, this implementation will only construct the 2-skeleton of $D_k(G)$. However, this code already implements the necessary methods for generating higher-order cell complexes, and can be easily updated as soon as TopoNetX supports dimensions > 2.

[1] A. Abrams and R. Ghrist. Finding topology in a factory: Configuration spaces. Amer. Math. Monthly 109:140–150, 2002.
[2] A. Abrams and R. Ghrist. State complexes for metamorphic robot systems. Int. J. Robotics Research 23(7–8):809–824, 2004.
[3] A. D. Abrams. Configuration Spaces and Braid Groups of Graphs. Ph.D. thesis, Dept. Math., U.C. Berkeley, 2000. link.

Copy link

Check out this pull request on  ReviewNB

See visual diffs & provide feedback on Jupyter Notebooks.


Powered by ReviewNB

@gbg141 gbg141 added challenge-icml-2024 Challenge submission award-category-1 Lifting to Simplicial or Cell Domain award-category-4 Connectivity-based Lifting labels Jul 13, 2024
@gbg141
Copy link
Member

gbg141 commented Jul 13, 2024

Hello @theo-long ! Thank you for your submission. As we near the end of the challenge, I am collecting participant info for the purpose of selecting and announcing winners. Please email me (or have one member of your team email me) at guillermo_bernardez@ucsb.edu so I can share access to the voting form. In your email, please include:

  • your first and last name (as well as any other team members)
  • the title of the method you implemented
  • the input domain of the method you implemented
  • the output domain of the method you implemented
  • your pull request number (Discrete Configuration Complex #65)

Before July 12, make sure that your submission respects all Submission Requirements laid out on the challenge page. Any submission that fails to meet this criteria will be automatically disqualified.

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Labels
award-category-1 Lifting to Simplicial or Cell Domain award-category-4 Connectivity-based Lifting challenge-icml-2024 Challenge submission
Projects
None yet
Development

Successfully merging this pull request may close these issues.

2 participants