We will propose four new directions of research. First, we will describe how to adapt M* to handle tasks that require multiple teams of cooperative robots. We will then describe how to combine fast, polynomial time solutions with subdimensional expansion to efficiently compute near-optimal paths. Finally, we will discuss methods of robust path planning utilizing sequential composition and topological heuristics.