Christopher Montez

Papers

Total Citations

H-Index

About

Christopher Montez is a rising scholar in multi-agent path planning and cooperative robotics, with a focus on optimizing movement through partially impeded or repairable networks. His research addresses critical challenges in logistics, disaster response, and autonomous convoy operations, where vehicles or robots must collaborate to navigate environments with damaged or initially impassable routes. Montez’s major contributions include developing novel path planning algorithms that coordinate a primary agent—such as a convoy or cardinal robot—with a support vehicle that clears or repairs obstacles ahead. His most-cited work, “Optimal Path Planning for a Convoy-Support Vehicle Pair Through a Repairable Network” (2023, 5 citations), introduces a graph-based framework for minimizing travel time in degraded road networks. In his earlier paper, “An Approximation Algorithm for an Assisted Shortest Path Problem” (2021, 2 citations), he presents a cooperative algorithm where a support robot must first traverse certain edges to enable passage for a cardinal robot. Though early in his career, Montez’s work is gaining traction for its practical relevance to autonomous systems and infrastructure resilience, establishing him as a promising voice in algorithmic robotics and network optimization.