paper-with-me

홈 › Papers

MPCC: A Novel Benchmark for Multimodal Planning with Complex Constraints in Multimodal Large Language Models

2025-07-31 · Yiyan Ji, Haoran Chen, Qiguang Chen, Chengyue Wu, Libo Qin, Wanxiang Che arxiv

Multimodal planning capabilities refer to the ability to predict, reason, and design steps for task execution with multimodal context, which is essential for complex reasoning and decision-making across multiple steps. However, current benchmarks face two key challenges: (1) they cannot directly assess multimodal real-world planning capabilities, and (2) they lack constraints or implicit constraints across modalities. To address these issues, we introduce Multimodal Planning with Complex Constraints (MPCC), the first benchmark to systematically evaluate MLLMs' ability to handle multimodal constraints in planning. To address the first challenge, MPCC focuses on three real-world tasks: Flight Planning, Calendar Planning, and Meeting Planning. To solve the second challenge, we introduce complex constraints (e.g. budget, temporal, and spatial) in these tasks, with graded difficulty levels (EASY, MEDIUM, HARD) to separate constraint complexity from search space expansion. Experiments on 13 advanced MLLMs reveal significant challenges: closed-source models achieve only 21.3% feasible plans, while open-source models average below 11%. Additionally, we observe that MLLMs are highly sensitive to constraint complexity and that traditional multimodal prompting strategies fail in multi-constraint scenarios. Our work formalizes multimodal constraints in planning, provides a rigorous evaluation framework, and highlights the need for advancements in constraint-aware reasoning for real-world MLLM applications.

📄 PDF Abstract BibTeX arXiv:2507.23382

Code (0)

등록된 구현이 없습니다.

Similar Papers 제목 키워드 기반

Bilevel Imaging Learning Problems as Mathematical Programs with Complementarity Constraints: Reformulation and Theory

2021-10-05 · Juan Carlos De Los Reyes

We investigate a family of bilevel imaging learning problems where the lower-level instance corresponds to a convex variational model involving first- and second-order nonsmooth sparsity-based regularizers. By using geom…

Trajectory Planning for an Articulated Commercial Vehicle using Model Predictive Contouring Control

2026-04-27 · A. J. Aertssen, R. G. M. Huisman, I. J. M. Besselink, J. Elfring 외 arxiv

This paper presents a trajectory planning method for articulated commercial vehicles, specifically tractor-semitrailers, based on Model Predictive Contouring Control (MPCC). Although MPCC has proven effective for passeng…

Trajectory Planning

IMPACT: An Implicit Active-Set Augmented Lagrangian for Fast Contact-Implicit Trajectory Optimization

2026-05-09 · Jiayun Li, Dejian Gong, Georgia Chalvatzaki arxiv

Contact-implicit trajectory optimization (CITO) has attracted growing attention as a unified framework for planning and control in contact-rich robotic tasks. Recent approaches have demonstrated promising results in mani…

ALADIN-$β$: A Distributed Optimization Algorithm for Solving MPCC Problems

2025-03-27 · Yifei Wang, Shuting Wu, Genke Yang, Jian Chu 외

Mathematical Programs with Complementarity Constraints (MPCC) are critical in various real-world applications but notoriously challenging due to non-smoothness and degeneracy from complementarity constraints. The $\ell_1…

Distributed Optimization

AD-MPCC: Adaptive Differentiable Model Predictive Contouring Control for Autonomous Racing

2026-06-30 · Nam T. Nguyen, Binh Nguyen, Ahmad Amine, Thanh Vo-Duy 외 arxiv

This paper presents Adaptive Differentiable Model Predictive Contouring Control (AD-MPCC), a framework for autonomous racing that integrates differentiable MPCC with online parameter estimation to handle varying road-sur…