We lifted 28 functions out of this paper's own repositories and ran 28 of them in a sandbox. "Ran" means the function executed on a synthesized input and returned a value. It is not a reproduction of the paper's results.
| Repository | Role | Ran |
|---|---|---|
| mohamedaghzal/llms-as-path-planners | canonical | 28 of 28 |
| Function | Status | Where it lives |
|---|---|---|
| a_star | Ran | mohamedaghzal/llms-as-path-planners/gpt-4-path-planning/src/generate_samples.py pointer only (licence: NONE) · get_code("1d7ecad86c4cf33d") |
| actions_and_effects | Ran | mohamedaghzal/llms-as-path-planners/ppnl-spatial-temporal-reasoning/ICL/actions_and_effect_prompts.py pointer only (licence: NONE) · get_code("f514998c2d24dde3") |
| build_path | Ran | mohamedaghzal/llms-as-path-planners/gpt-4-path-planning/src/place_agent_goals_sg.py pointer only (licence: NONE) · get_code("e668aeb35a33a774") |
| construct_grid | Ran | mohamedaghzal/llms-as-path-planners/gpt-4-path-planning/src/place_agent_goals_sg.py pointer only (licence: NONE) · get_code("8419ce244e148b28") |
| count_obstacles | Ran | mohamedaghzal/llms-as-path-planners/ppnl-spatial-temporal-reasoning/ICL/actions_and_effect_prompts.py pointer only (licence: NONE) · get_code("f7e0e94c07eec3e4") |
| draw_path | Ran | mohamedaghzal/llms-as-path-planners/gpt-4-path-planning/src/prompting.py pointer only (licence: NONE) · get_code("5a4054d663046894") |
| exact_match | Ran | mohamedaghzal/llms-as-path-planners/gpt-4-path-planning/src/evaluate.py pointer only (licence: NONE) · get_code("806fb301720451ec") |
| fixed_length | Ran | mohamedaghzal/llms-as-path-planners/gpt-4-path-planning/src/helpers.py pointer only (licence: NONE) · get_code("caa8df4c4d1fd565") |
| generate_code | Ran | mohamedaghzal/llms-as-path-planners/gpt-4-path-planning/src/generate_samples.py pointer only (licence: NONE) · get_code("c274f392ee719051") |
| generate_code_alternate_column | Ran | mohamedaghzal/llms-as-path-planners/gpt-4-path-planning/src/representations.py pointer only (licence: NONE) · get_code("0702ff5547719980") |
| generate_code_rectangle | Ran | mohamedaghzal/llms-as-path-planners/gpt-4-path-planning/src/representations.py pointer only (licence: NONE) · get_code("b1c836fbb3f4d4fc") |
| generate_code_spiral | Ran | mohamedaghzal/llms-as-path-planners/gpt-4-path-planning/src/representations.py pointer only (licence: NONE) · get_code("35a7867d3c2e93af") |
| generate_effects | Ran | mohamedaghzal/llms-as-path-planners/gpt-4-path-planning/src/prompting.py pointer only (licence: NONE) · get_code("00e00e527a7e268c") |
| generate_grid | Ran | mohamedaghzal/llms-as-path-planners/gpt-4-path-planning/src/generate_samples.py pointer only (licence: NONE) · get_code("89b81366df015ab8") |
| generate_worlds | Ran | mohamedaghzal/llms-as-path-planners/gpt-4-path-planning/src/place_agent_goals_sg.py pointer only (licence: NONE) · get_code("cebb72c7aecd9c49") |
| get_actual | Ran | mohamedaghzal/llms-as-path-planners/ppnl-spatial-temporal-reasoning/ICL/parse_react_mg_path.py pointer only (licence: NONE) · get_code("d3e9e3908a9df9c8") |
| is_row | Ran | mohamedaghzal/llms-as-path-planners/gpt-4-path-planning/src/planning_samples.py pointer only (licence: NONE) · get_code("3a2159f19cba31c7") |
| one_opening_per_column | Ran | mohamedaghzal/llms-as-path-planners/gpt-4-path-planning/src/one_entrance.py pointer only (licence: NONE) · get_code("1ddb64e34d0ffc15") |
| one_opening_per_row | Ran | mohamedaghzal/llms-as-path-planners/gpt-4-path-planning/src/one_entrance.py pointer only (licence: NONE) · get_code("f62c1ffb342ad79d") |
| out_of_bounds | Ran | mohamedaghzal/llms-as-path-planners/gpt-4-path-planning/src/prompting.py pointer only (licence: NONE) · get_code("a93c8460f75834dc") |
| parse_react_path | Ran | mohamedaghzal/llms-as-path-planners/ppnl-spatial-temporal-reasoning/ICL/parse_react_mg_path.py pointer only (licence: NONE) · get_code("2aa266d417a4012c") |
| rectangle | Ran | mohamedaghzal/llms-as-path-planners/gpt-4-path-planning/src/geometries.py pointer only (licence: NONE) · get_code("ba3aa7daeaf50708") |
| sample | Ran | mohamedaghzal/llms-as-path-planners/gpt-4-path-planning/src/one_entrance.py pointer only (licence: NONE) · get_code("822d5128406dc0b4") |
| single_environment | Ran | mohamedaghzal/llms-as-path-planners/gpt-4-path-planning/src/helpers.py pointer only (licence: NONE) · get_code("8ed9120665b11d99") |
| spiral_maze | Ran | mohamedaghzal/llms-as-path-planners/gpt-4-path-planning/src/geometries.py pointer only (licence: NONE) · get_code("8d0323e6656ee492") |
| success_sg | Ran | mohamedaghzal/llms-as-path-planners/gpt-4-path-planning/src/evaluate.py pointer only (licence: NONE) · get_code("d74bce6422f92cd8") |
| triangle | Ran | mohamedaghzal/llms-as-path-planners/gpt-4-path-planning/src/geometries.py pointer only (licence: NONE) · get_code("02579eedf3922c00") |
| valid_position | Ran | mohamedaghzal/llms-as-path-planners/gpt-4-path-planning/src/evaluate.py pointer only (licence: NONE) · get_code("4ac5d326cb14bb91") |
Some links come from the archived Papers with Code dataset (CC BY-SA 4.0): attribution and licence.
Large language models (LLMs) have achieved remarkable success across a wide spectrum of tasks; however, they still face limitations in scenarios that demand long-term planning and spatial reasoning. To facilitate this line of research, in this work, we propose a new benchmark, termed $\textbf{P}$ath $\textbf{P}$lanning from $\textbf{N}$atural $\textbf{L}$anguage ($\textbf{PPNL}$). Our benchmark evaluates LLMs' spatial-temporal reasoning by formulating ''path planning'' tasks that require an LLM to navigate to target locations while avoiding obstacles and adhering to constraints. Leveraging this benchmark, we systematically investigate LLMs including GPT-4 via different few-shot prompting methodologies as well as BART and T5 of various sizes via fine-tuning. Our experimental results show the promise of few-shot GPT-4 in spatial reasoning, when it is prompted to reason and act interleavedly, although it still fails to perform long-term temporal reasoning. In contrast, while fine-tuned LLMs achieved impressive results on in-distribution reasoning tasks, they struggled to generalize to larger environments or environments with more obstacles.
The same record, over MCP at https://syntology.ai/mcp:
get_harvested_code_for_paper("2310.03249")
get_code_for_paper("2310.03249")
have("2310.03249")
Connect an agent — have() is free.