- Rating
- 1
- Confidence
- 3
- Informativeness
- 1
- Presentation
- 1
- Soundness
- 2
Read review
Paper summary
This paper proposes TSCraft, an LLM-guided framework that iteratively evolves rule-based traffic signal control policies using simulation feedback, experience memory, and multi-candidate selection.
Critical strengths
- The framework separates offline LLM-guided policy evolution from online TSC, enabling efficient deployment without runtime LLM inference.
- The generated rule-based policies are interpretable and computationally efficient.
Critical weaknesses
- The manuscript is difficult to follow, as several important methodological details are not clearly explained. In particular, Section 2 introduces numerous concepts and mathematical formulations without clearly describing what the Python-based control policies contain or how they evolve.
- Previous studies, such as π-Light (AAAI 2024), have already explored automatically discovering interpretable traffic signal control policies through program search. TSCraft follows a similar idea but relies on LLM-guided code generation and selection. However, the advantages of using LLMs over conventional program search methods remain unclear. Furthermore, π-Light is not included in the experimental baselines, making it difficult to assess the effectiveness of TSCraft relative to existing programmatic approaches.
- Although the experiments demonstrate promising results across different intersections and cities, it remains unclear whether this generalization comes from the proposed LLM-guided evolution process or primarily from the topology-normalized representation and the transferability of rule-based policies.
Questions for authors
- What are the key advantages of LLM-guided policy evolution over conventional program search methods such as π-Light.
- Given that TSCraft ultimately produces a fixed rule-based controller, what justifies its general applicability across different intersections and traffic conditions without further tuning? How does it differ in this regard from classical traffic control formulas, such as Webster's?
- How can a single LLM-generated fixed control policy outperform RL-based policies across different traffic scenarios, given that neural network-based RL policies can represent more complex traffic conditions and control strategies? What explains the superior performance of such a relatively simple heuristic policy?
Dear Reviewers,
Please review the authors' rebuttal and participate in the discussion to address any remaining questions before the period closes on Nov 18 AoE.
Thank you!
AC