Papers › TravelPlanner: A Benchmark for Real-World Planning with Language Agents

TravelPlanner: A Benchmark for Real-World Planning with Language Agents

2 Feb 2024arXiv:2402.01622archive 2025-07-28

Jian Xie, Kai Zhang, Jiangjie Chen, Tinghui Zhu, Renze Lou, Yuandong Tian, Yanghua Xiao, Yu Su

Planning has been part of the core pursuit for artificial intelligence since its conception, but earlier AI agents mostly focused on constrained settings because many of the cognitive substrates necessary for human-level planning have been lacking. Recently, language agents powered by large language models (LLMs) have shown interesting capabilities such as tool use and reasoning. Are these language agents capable of planning in more complex settings that are out of the reach of prior AI agents? To advance this investigation, we propose TravelPlanner, a new planning benchmark that focuses on travel planning, a common real-world planning scenario. It provides a rich sandbox environment, various tools for accessing nearly four million data records, and 1,225 meticulously curated planning intents and reference plans. Comprehensive evaluations show that the current language agents are not yet capable of handling such complex planning tasks-even GPT-4 only achieves a success rate of 0.6%. Language agents struggle to stay on task, use the right tools to collect information, or keep track of multiple constraints. However, we note that the mere possibility for language agents to tackle such a complex problem is in itself non-trivial progress. TravelPlanner provides a challenging yet meaningful testbed for future language agents.

PaperPDFCodeCode Syntology ran

In Syntology Open this paper in Syntology's Atlas, the map of the papers in Syntology's graph and their citations.

For agents, Syntology's MCP tool lists every function and class Syntology harvested from this paper and whether it ran (how to connect): get_harvested_code_for_paper(arxiv_id="2402.01622")

Code

Syntology Ran 17 of 17 code samples harvested from 2 repositories linked to this paper; 0 have no recorded run. Of those that ran: 1 ran · honoured contract; 4 ran · our draft was wrong; 12 ran with no contract checked.

By repository: official repository: 13 samples from 1 repository, 13 ran; community (archive-listed): 4 samples from 1 repository, 4 ran. The run record, sample by sample. “Ran” means executed on a synthesized input, not that the code is correct or reproduces the paper.

OSU-NLP-Group/TravelPlanner officialmentioned on GitHubMIT report
llv22/travelplanner_forward mentioned on GitHub report

Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.

Code Syntology ran Syntology

17 samples harvested; 17 ran; 1 honoured the contract we drafted; 0 have no recorded run. Read from Syntology's graph 2026-09-24; that is when this build read the record, not when the samples ran.

1ran · honoured contract
4ran · our draft was wrong
12ran

Licence: 4 of the 17 samples are pointer only, meaning Syntology does not serve that copy's text. This page shows no code text for any sample; each one links to its file in the repository.

Harvested from 2 repositories linked to this paper, official or community; each sample names its own and says which. “Ran” means the sample executed on a synthesized input. It does not mean the output is correct, and nothing here reproduces the paper's results. “Honoured” and “violated” refer to a contract Syntology drafted from the code itself; “our draft was wrong” and “fixture could not drive it” are failures of Syntology's instrument, not of the code.

Each sample ends with its code_sha256, Syntology's identity for that exact code. An agent fetches the stored sample with Syntology's MCP tool get_code(code_sha256="…") (how to connect); click an identity to copy that call.

Repository labels, per sample. official repository: The archive marks this repository official for the paper. named in the paper: The archive records that the paper mentions this repository; it is not marked official. community (archive-listed): In the archive's code links for this paper, not marked official and not recorded as mentioned in the paper. found in paper text by Syntology: Syntology found this repository in the paper's own text; whether it is the authors' implementation is not asserted. community: Not in the archive's code links for this paper; a community repository Syntology harvested. Samples from a repository marked official are listed first. Licence labels name the repository's licence as recorded at harvest. “Pointer only” means Syntology does not serve that copy's text, for one of four reasons: no licence file was found; the licence was not identified; the licence is recorded as permissive but that copy's record is not marked cleared; or the licence is outside the permissive list Syntology serves text under (MIT, Apache-2.0, BSD and similar). Some licences outside that list permit redistribution, such as WTFPL, and GPL-3.0 under its conditions; they are simply not on the list. Hover a licence label for the reason. File links open the file on GitHub at the default branch, which may have changed since the harvest.

calc_cost_w_tokens OSU-NLP-Group/TravelPlanner/postprocess/openai_request.py official repository ran MIT (permissive) · 3589cdef8c72142f · report
convert_bool_values OSU-NLP-Group/TravelPlanner/evaluation/hard_constraint.py official repository ran MIT (permissive) · 144615fb5218a49a · report
count_consecutive_values OSU-NLP-Group/TravelPlanner/evaluation/commonsense_constraint.py official repository ran MIT (permissive) · 2f9ab3378b37a898 · report
create_data_display OSU-NLP-Group/TravelPlanner/utils/func.py official repository ran MIT (permissive) · acd03219e0d9155b · report
estimate_budget OSU-NLP-Group/TravelPlanner/utils/budget_estimation.py official repository ran MIT (permissive) · a96fb9bafb5a310a · report
extract_before_parenthesis OSU-NLP-Group/TravelPlanner/agents/greedy_search.py official repository ran fingerprinted MIT (permissive) · 6f3fd21fac52a0df · report
extract_from_to OSU-NLP-Group/TravelPlanner/evaluation/hard_constraint.py official repository ran fingerprinted MIT (permissive) · 274ece3906f9cef5 · report
extract_query_number OSU-NLP-Group/TravelPlanner/utils/func.py official repository ran fingerprinted MIT (permissive) · 6f08d8cc8543ebda · report
format_step OSU-NLP-Group/TravelPlanner/agents/tool_agents.py official repository ran · our draft was wrong fingerprinted MIT (permissive) · 84d28fbaf38b0a59 · report
get_city_list OSU-NLP-Group/TravelPlanner/agents/greedy_search.py official repository ran MIT (permissive) · 1a12abefb2af139e · report
limited_execution_time OSU-NLP-Group/TravelPlanner/postprocess/openai_request.py official repository ran MIT (permissive) · cf6909a439ea97be · report
openai_unit_price OSU-NLP-Group/TravelPlanner/postprocess/openai_request.py official repository ran fingerprinted MIT (permissive) · db2cf6f145458dbc · report
transportation_match OSU-NLP-Group/TravelPlanner/evaluation/commonsense_constraint.py official repository ran fingerprinted MIT (permissive) · 610e4862668ffe73 · report
convert_reference_information llv22/travelplanner_forward/tools/planner/sole_planning.py community (archive-listed) ran · our draft was wrong no licence file found · pointer only · 77c486c16345d89e · report
extract_numbers_from_filenames llv22/travelplanner_forward/tools/planner/sole_planning.py community (archive-listed) ran · honoured contract no licence file found · pointer only · 7877a8bad070567d · report
load_line_json_data llv22/travelplanner_forward/tools/planner/sole_planning.py community (archive-listed) ran · our draft was wrong no licence file found · pointer only · 959eef29433a0a23 · report
parse_action llv22/travelplanner_forward/agents/tool_agents.py community (archive-listed) ran · our draft was wrong fingerprinted no licence file found · pointer only · 744db5623472fa82 · report

Results from the paper archive 2025-07-28

No leaderboard rows for this paper in the archive.

Methods

Absolute Position EncodingsAdamAttentionBPEDense ConnectionsDropoutGPT-4Label SmoothingLayer NormalizationLinear LayerMulti-Head AttentionPosition-Wise Feed-Forward LayerResidual ConnectionSoftmaxTransformer

2 archive method tags without a method page not shown.

Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections