:: Library Catalog

Cover Image

Saved in:

Bibliographic Details
Main Authors:	Schmalz, Johannes, Trevizan, Felipe
Format:	Preprint
Published:	2024
Subjects:	Artificial Intelligence
Online Access:	https://arxiv.org/abs/2401.14636
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Efficient Constraint Generation for Stochastic Shortest Path Problems
by: Schmalz, Johannes, et al.
Published: (2026)

Solving Constrained Stochastic Shortest Path Problems with Scalarisation
by: Schmalz, Johannes, et al.
Published: (2025)

Algorithms for Deciding the Safety of States in Fully Observable Non-deterministic Problems: Technical Report
by: Schmalz, Johannes, et al.
Published: (2026)

Generalization in LLM Problem Solving: The Case of the Shortest Path
by: Tong, Yao, et al.
Published: (2026)

Leveraging Action Relational Structures for Integrated Learning and Planning
by: Wang, Ryan Xiao, et al.
Published: (2025)

Heuristic Search for Multi-Objective Probabilistic Planning
by: Chen, Dillon, et al.
Published: (2023)

Enhanced Methods for the Weight Constrained Shortest Path Problem
by: Ahmadi, Saman, et al.
Published: (2022)

Learning Efficiency Meets Symmetry Breaking
by: Bai, Yingbin, et al.
Published: (2025)

Return to Tradition: Learning Reliable Heuristics with Classical Machine Learning
by: Chen, Dillon Z., et al.
Published: (2024)

Learning Domain-Independent Heuristics for Grounded and Lifted Planning
by: Chen, Dillon Z., et al.
Published: (2023)

Learning Shortest Paths with Generative Flow Networks
by: Morozov, Nikita, et al.
Published: (2026)

A Generalization of the Shortest Path Problem to Graphs with Multiple Edge-Cost Estimates
by: Weiss, Eyal, et al.
Published: (2022)

Knapsack: Connectedness, Path, and Shortest-Path
by: Dey, Palash, et al.
Published: (2023)

Evolving A* to Efficiently Solve the k Shortest-Path Problem (Extended Version)
by: López, Carlos Linares, et al.
Published: (2024)

Robust Stochastic Shortest-Path Planning via Risk-Sensitive Incremental Sampling
by: Enwerem, Clinton, et al.
Published: (2024)

DataSP: A Differential All-to-All Shortest Path Algorithm for Learning Costs and Predicting Paths with Context
by: Lahoud, Alan A., et al.
Published: (2024)

Graph Learning for Planning: The Story Thus Far and Open Challenges
by: Chen, Dillon Z., et al.
Published: (2024)

Tightest Admissible Shortest Path
by: Weiss, Eyal, et al.
Published: (2023)

Logic-Constrained Shortest Paths for Flight Planning
by: Euler, Ricardo, et al.
Published: (2024)

Beyond Shortest Path: Agentic Vehicular Routing with Semantic Context
by: Braun, Carnot, et al.
Published: (2025)

A Preprocessing Framework for Efficient Approximate Bi-Objective Shortest-Path Computation in the Presence of Correlated Objectives
by: Halle, Yaron, et al.
Published: (2025)

S-Path-RAG: Semantic-Aware Shortest-Path Retrieval Augmented Generation for Multi-Hop Knowledge Graph Question Answering
by: Fu, Rong, et al.
Published: (2026)

Locally Optimal Solutions to Constraint Displacement Problems via Path-Obstacle Overlaps
by: Thomas, Antony, et al.
Published: (2025)

Threshold Adaptation in Spiking Networks Enables Shortest Path Finding and Place Disambiguation
by: Dietrich, Robin, et al.
Published: (2025)

Revisiting the Graph Reasoning Ability of Large Language Models: Case Studies in Translation, Connectivity and Shortest Path
by: Dai, Xinnan, et al.
Published: (2024)

OPMOS: Ordered Parallel Algorithm for Multi-Objective Shortest-Paths
by: Gold, Leo, et al.
Published: (2024)

Multiagent Stochastic Shortest Path Problem
by: Jonáš, Martin, et al.
Published: (2026)

SPOC: Imitating Shortest Paths in Simulation Enables Effective Navigation and Manipulation in the Real World
by: Ehsani, Kiana, et al.
Published: (2023)

On Computing Top-$k$ Simple Shortest Paths from a Single Source
by: D'Emidio, Mattia, et al.
Published: (2025)

On the Bias of Next-Token Predictors Toward Systematically Inefficient Reasoning: A Shortest-Path Case Study
by: Alberghi, Riccardo, et al.
Published: (2025)

Solving Stochastic Orienteering Problems with Chance Constraints Using a GNN Powered Monte Carlo Tree Search
by: Zuzuárregui, Marcos Abel, et al.
Published: (2024)

Automatic Generation of Polynomial Symmetry Breaking Constraints
by: Erascu, Madalina, et al.
Published: (2026)

The Computational Learning of Construction Grammars: State of the Art and Prospective Roadmap
by: Doumen, Jonas, et al.
Published: (2024)

Explainable Distributed Constraint Optimization Problems
by: Rachmut, Ben, et al.
Published: (2025)

Predictive Spike Timing Enables Distributed Shortest Path Computation in Spiking Neural Networks
by: Storesund, Simen, et al.
Published: (2025)

Towards Efficient Constraint Handling in Neural Solvers for Routing Problems
by: Bi, Jieyi, et al.
Published: (2026)

Stochastic Shortest Path Problem with Failure Probability
by: Otsubo, Ritsusamuel
Published: (2024)

Stochastic Trajectory Prediction under Unstructured Constraints
by: Ma, Hao, et al.
Published: (2025)

The Optimal Choice of Hypothesis Is the Weakest, Not the Shortest
by: Bennett, Michael Timothy
Published: (2023)

Generalizing Constraint Models in Constraint Acquisition
by: Tsouros, Dimos, et al.
Published: (2024)