Copertina

A Preprocessing Framework for Efficient Approximate Bi-Objective Shortest-Path Computation in the Presence of Correlated Objectives

Fuente: arXiv

Salvato in:

Dettagli Bibliografici
Autori principali:	Halle, Yaron, Felner, Ariel, Koenig, Sven, Salzman, Oren
Natura:	Preprint
Pubblicazione:	2025
Soggetti:	Artificial Intelligence
Accesso online:	Acceder al recurso
Tags:	Aggiungi Tag Nessun Tag, puoi essere il primo ad aggiungerne!!

Documenti analoghi

Multi-Objective Search: Algorithms, Applications, and Emerging Directions
di: Salzman, Oren, et al.
Pubblicazione: (2025)

Bridging the Evaluation Gap: Standardized Benchmarks for Multi-Objective Search
di: Peer, Hadar, et al.
Pubblicazione: (2026)

Generalizing Multi-Objective Search via Objective-Aggregation Functions
di: Peer, Hadar, et al.
Pubblicazione: (2025)

Tightest Admissible Shortest Path
di: Weiss, Eyal, et al.
Pubblicazione: (2023)

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

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

Diverse Transformer Decoding for Offline Reinforcement Learning Using Financial Algorithmic Approaches
di: Elbaz, Dan, et al.
Pubblicazione: (2025)

Enhancing Lifelong Multi-Agent Path-finding by Using Artificial Potential Fields
di: Pertzovsky, Arseniy, et al.
Pubblicazione: (2025)

EfficientTDMPC: Improved MPC Objectives for Sample-Efficient Continuous Control
di: Evers, Thomas, et al.
Pubblicazione: (2026)

ITA-ECBS: A Bounded-Suboptimal Algorithm for the Combined Target-Assignment and Path-Finding Problem
di: Tang, Yimin, et al.
Pubblicazione: (2024)

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

Efficient Constraint Generation for Stochastic Shortest Path Problems
di: Schmalz, Johannes, et al.
Pubblicazione: (2024)

Computational Dualism and Objective Superintelligence
di: Bennett, Michael Timothy
Pubblicazione: (2023)

Anytime Multi-Agent Path Finding with an Adaptive Delay-Based Heuristic
di: Phan, Thomy, et al.
Pubblicazione: (2024)

New Mechanisms in Flex Distribution for Bounded Suboptimal Multi-Agent Path Finding
di: Chan, Shao-Hung, et al.
Pubblicazione: (2025)

On Parallel External-Memory Bidirectional Search
di: Siag, Lior, et al.
Pubblicazione: (2024)

Why Solving Multi-agent Path Finding with Large Language Model has not Succeeded Yet
di: Chen, Weizhe, et al.
Pubblicazione: (2024)

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

Adaptive Anytime Multi-Agent Path Finding Using Bandit-Based Large Neighborhood Search
di: Phan, Thomy, et al.
Pubblicazione: (2023)

Bidirectional Bounded-Suboptimal Heuristic Search with Consistent Heuristics
di: Shperberg, Shahaf S., et al.
Pubblicazione: (2025)

FBOS-RL: Feedback-Driven Bi-Objective Synergistic Reinforcement Learning
di: Zhang, Xikai, et al.
Pubblicazione: (2026)

Fence Theorem: Towards Dual-Objective Semantic-Structure Isolation in Preprocessing Phase for 3D Anomaly Detection
di: Liang, Hanzhe, et al.
Pubblicazione: (2025)

Accelerating Focal Search in Multi-Agent Path Finding with Tighter Lower Bounds
di: Tang, Yimin, et al.
Pubblicazione: (2025)

Contextual Multi-Objective Optimization: Rethinking Objectives in Frontier AI Systems
di: Zhou, Jie, et al.
Pubblicazione: (2026)

Preference-Driven Multi-Objective Combinatorial Optimization with Conditional Computation
di: Fan, Mingfeng, et al.
Pubblicazione: (2025)

Multi-Objective Multi-Agent Path Finding with Lexicographic Cost Preferences
di: Rustagi, Pulkit, et al.
Pubblicazione: (2025)

Multi-Agent Path Finding in Continuous Spaces with Projected Diffusion Models
di: Liang, Jinhao, et al.
Pubblicazione: (2024)

A Bi-Objective Approach to Last-Mile Delivery Routing Considering Driver Preferences
di: Mesa, Juan Pablo, et al.
Pubblicazione: (2024)

Large Language Models as Amortized Pareto-Front Generators for Constrained Bi-Objective Convex Optimization
di: Xu, Peipei, et al.
Pubblicazione: (2026)

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

Iterative Deepening Sampling as Efficient Test-Time Scaling
di: Chen, Weizhe, et al.
Pubblicazione: (2025)

Reversing the Forget-Retain Objectives: An Efficient LLM Unlearning Framework from Logit Difference
di: Ji, Jiabao, et al.
Pubblicazione: (2024)

RAILGUN: A Unified Convolutional Policy for Multi-Agent Path Finding Across Different Environments and Tasks
di: Tang, Yimin, et al.
Pubblicazione: (2025)

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

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

A Theoretical Analysis of Efficiency Constrained Utility-Privacy Bi-Objective Optimization in Federated Learning
di: Gu, Hanlin, et al.
Pubblicazione: (2023)

Interpretability by Design for Efficient Multi-Objective Reinforcement Learning
di: Xia, Qiyue, et al.
Pubblicazione: (2025)

Approximation of Box Decomposition Algorithm for Fast Hypervolume-Based Multi-Objective Optimization
di: Watanabe, Shuhei
Pubblicazione: (2025)

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

Enhancing Lifelong Multi-Agent Path Finding with Cache Mechanism
di: Tang, Yimin, et al.
Pubblicazione: (2025)