Domain-Aware Machine Learning for Accelerating MILP-Based Motion Planning with Temporal Logic and Chance Constraints

Motion-planning problems with temporal-logic or chance constraints are often encoded as mixed-integer linear programs (MILPs). Although these encodings provide rigorous specifications, their combinatorial structure can make planning prohibitively slow. Machine learning for combinatorial optimization (ML4CO) has accelerated general-purpose MILP solving, but its standard graph representations discard semantic information available in control problems, such as variable roles, time indices, sample identities, and formula structure. We introduce a domain-aware ML4CO framework for MILP-based motion planning with temporal logic and chance constraints. The framework augments a conventional variable--constraint bipartite graph with features derived from the planning formulation and uses the resulting representation for two solver-guidance tasks: selecting branching backdoors and configuring solver parameters. We study three domains---Signal Temporal Logic (STL) planning, chance-constrained planning through Conformal Predictive Programming (CPP), and multi-agent Capability Temporal Logic (CaTL) planning---and compare against solver defaults, domain-agnostic learned methods, non-learned branching rules, MCTS transfer, and SMAC3 transfer. Across the tested distributions, domain-aware backdoor selection has the lowest reported mean solve time in all three domains, improving on default Gurobi by 14.4--20.4%. Domain-aware configuration also has the lowest mean primal gap and primal integral in all three domains under a fixed SCIP time limit. These results show that exposing control-specific structure can improve learned MILP guidance beyond generic optimization features.