Graph braid groups are the fundamental groups of configuration spaces of particles in a graph. They can be expressed as the fundamental groups of special cube complexes. In a joint work with Kevin Schreve, we study a question of whether certain sets of elements in a graph braid group generate a right-angled Artin group. We use it to compute the topological complexity of graph braid groups with sufficiently many particles, which is a topological invariant measuring discontinuity of motion planning.