arXiv:2606. 14956v1 Announce Type: new Abstract: Autonomous driving systems rely on precise trajectory prediction to plan safe and efficient movement.
arXiv:2607. 10565v1 Announce Type: cross Abstract: End-to-end motion planning has emerged as a promising paradigm in autonomous driving, directly mapping raw sensor data to control commands via deep neural networks.
The paper introduces a scalable heterogeneous Graph Neural Network framework that automatically generates and evaluates shared roadmaps for multi‑agent path planning in continuous environments. By representing waypoints, agent locations, and task locations as distinct nodes, the GNN learns from expert solver trajectories to identify critical points and prune redundant connections, producing a compact, coordination‑aware roadmap. Experiments show the approach can reduce planning effort, achieving at least a 40% reduction in runtime and graph size for dense roadmaps.
arXiv:2501. 17559v2 Announce Type: replace Abstract: After the achievement of solving two-player zero-sum games, more AI researchers focus on solving multiplayer games.
arXiv:2604.02927v3 Announce Type: replace Abstract: Routing algorithms are crucial for efficient computer network operations, and in many settings they must be able to react to traffic bursts within...
arXiv:2608.29054v1 Announce Type: new Abstract: Graph Neural Networks (GNNs) have emerged as a cornerstone for representing complex relational dependencies in diverse multimedia tasks, particularly i...
SiST‑GNN introduces a simultaneous spatial‑temporal message‑passing framework for dynamic graph neural networks, fusing per‑node temporal embeddings with spatial aggregation in a single operation. By maintaining a recurrent hidden state per node and treating it as a cross‑time edge, the model jointly reasons over topology and evolution. Experiments on link‑prediction and node‑classification benchmarks show significant improvements over prior methods, achieving up to 158% gains in live‑update link prediction and outperforming discrete‑time baselines by 7–23% in dynamic node classification.
The paper introduces a cluster-based method for predicting dense crowd trajectories, grouping individuals with similar attributes over time to accelerate processing. By replacing individual pedestrian inputs with cluster centroids, the approach reduces computational cost and memory usage while preserving accuracy. Extensive evaluations on challenging dense crowd scenes confirm these benefits compared to state‑of‑the‑art methods.
arXiv:2509. 23413v3 Announce Type: replace Abstract: Multi-task neural routing solvers have emerged as a promising paradigm for their ability to solve multiple vehicle routing problems (VRPs) using a single model.
arXiv:2608. 14121v1 Announce Type: cross Abstract: Graph Neural Networks (GNNs) can solve prediction tasks by unintentionally exploiting shortcuts---that is, edges, nodes, and features that correlate with but are not causal for the prediction---which compromise their reliability in out-of-distribution tasks.
arXiv:2606. 06217v1 Announce Type: cross Abstract: When a disaster unfolds, responders must answer not only what is happening, but also why it is happening, what will happen next, and what to do now, often from noisy low-altitude UAV views and under tight on-site compute constraints.
arXiv:2607. 09741v1 Announce Type: cross Abstract: Accurate trajectory prediction in autonomous driving hinges on modeling dynamic and context-dependent interactions among traffic agents.