Elite Lanes: Evolutionary Generation of Realistic Small-Scale Road Networks

• URL: http://arxiv.org/abs/2603.20964v1
• Date: Sat, 21 Mar 2026 22:24:50 GMT
• Title: Elite Lanes: Evolutionary Generation of Realistic Small-Scale Road Networks
• Abstract summary: We present a comparative study of methods for generating realistic, constrained small- to medium-scale road networks with built-in redundancy.<n>Our focus is on producing realistic, redundant road networks suitable for vision, localization and navigation problems.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: We present a comparative study of methods for generating realistic, constrained small- to medium-scale road networks with built-in redundancy. In this research, we evaluate the proposed Evolutionary Algorithm (EA) with connectivity and redundancy constraints against the Wave Function Collapse (WFC) method - commonly used in procedural terrain generation for games - and swarm algorithms: Particle Swarm (PSO) and Gray Wolf (GWO). Our focus is on producing realistic, redundant road networks suitable for vision, localization and navigation problems. We evaluate metrics: connectivity, cycles, intersections, dead ends, graph cut-edges while enforcing physical plausibility. We propose an EA and its extended version with elitism via MAP-Elites method. We detail the implementation, constraints, metrics and provide both visual and quantitative comparisons with baselines. Results highlight how fitness function design choices affect the structural characteristics of generated networks and highlight the impact of specific constraints in practical applications. Our contribution is a method for creating realistic synthetic datasets from sparse tile definitions derived from real-world data. We demonstrate a practical application by generating realistic maps using a laboratory-collected tileset from a Duckietown city model. Our approach performs coherent geometric transformations on metadata, in this work exemplified by semantic segmentation masks of the generated road networks.

Related papers

• LeCropFollow: Latent Space Planning for Navigation in Unstructured Crop Fields [7.898784066160524]
  We present LeCropFollow, a visual navigation framework that bypasses explicit geometric modeling in favor of a learned latent representation.<n>We show that LeCropFollow matches state-of-the-art baselines in unstructured rows but significantly outperforms them in plantation gaps.<n>These results suggest that latent planning offers a robust alternative to geometric estimation for operations in heterogeneous agricultural environments.
  arXiv  Detail & Related papers  (2026-06-30T16:47:08Z)
• Generative Adversarial Gumbel MCTS for Abstract Visual Composition Generation [29.755551944026738]
  We study abstract visual composition in which identity is determined by the configuration and relations among a small set of geometric primitives.<n>An AlphaGo-style search enforces feasibility, while a fine-tuned vision-language model scores semantic alignment as reward signals.<n>Inspired by the Generative Adversarial Network, we use the generated instances for adversarial reward refinement.
  arXiv  Detail & Related papers  (2025-12-01T03:38:44Z)
• Scaling Up Occupancy-centric Driving Scene Generation: Dataset and Method [54.461213497603154]
  Occupancy-centric methods have recently achieved state-of-the-art results by offering consistent conditioning across frames and modalities.<n>Nuplan-Occ is the largest occupancy dataset to date, constructed from the widely used Nuplan benchmark.<n>We develop a unified framework that jointly synthesizes high-quality occupancy, multi-view videos, and LiDAR point clouds.
  arXiv  Detail & Related papers  (2025-10-27T03:52:45Z)
• Non-Rigid Structure-from-Motion via Differential Geometry with Recoverable Conformal Scale [17.935227965480475]
  We introduce a novel method, called Con-NRSfM, for NRSfM under conformal deformations.<n>Our approach performs point-wise reconstruction using 2D selected image warps optimized through a graph-based framework.<n>Our framework decouples constraints on depth and conformal scale, which are inseparable in other approaches.
  arXiv  Detail & Related papers  (2025-10-02T04:46:46Z)
• Topology-Aware Modeling for Unsupervised Simulation-to-Reality Point Cloud Recognition [63.55828203989405]
  We introduce a novel Topology-Aware Modeling (TAM) framework for Sim2Real UDA on object point clouds.<n>Our approach mitigates the domain gap by leveraging global spatial topology, characterized by low-level, high-frequency 3D structures.<n>We propose an advanced self-training strategy that combines cross-domain contrastive learning with self-training.
  arXiv  Detail & Related papers  (2025-06-26T11:53:59Z)
• HetGL2R: Learning to Rank Critical Road Segments via Attributed Heterogeneous Graph Random Walks [1.015962377068103]
  HetGL2R is an attributed heterogeneous graph learning approach for ranking node importance in road networks.<n>HetGL2R significantly outperforms baselines in incorporating OD demand and route choice information, achieving more accurate and robust node ranking.
  arXiv  Detail & Related papers  (2025-04-27T11:32:41Z)
• A Geometry-Aware Message Passing Neural Network for Modeling Aerodynamics over Airfoils [61.60175086194333]
  aerodynamics is a key problem in aerospace engineering, often involving flows interacting with solid objects such as airfoils.<n>Here, we consider modeling of incompressible flows over solid objects, wherein geometric structures are a key factor in determining aerodynamics.<n>To effectively incorporate geometries, we propose a message passing scheme that efficiently and expressively integrates the airfoil shape with the mesh representation.<n>These design choices lead to a purely data-driven machine learning framework known as GeoMPNN, which won the Best Student Submission award at the NeurIPS 2024 ML4CFD Competition, placing 4th overall.
  arXiv  Detail & Related papers  (2024-12-12T16:05:39Z)
• Efficient Data Representation for Motion Forecasting: A Scene-Specific Trajectory Set Approach [12.335528093380631]
  This study introduces a novel approach for generating scene-specific trajectory sets tailored to different contexts.<n>A deterministic goal sampling algorithm identifies relevant map regions, while our Recursive In-Distribution Subsampling (RIDS) method enhances trajectory plausibility.<n>Experiments on the Argoverse 2 dataset demonstrate that our method achieves up to a 10% improvement in Driving Area Compliance.
  arXiv  Detail & Related papers  (2024-07-30T11:06:39Z)
• Visual SLAM with Graph-Cut Optimized Multi-Plane Reconstruction [11.215334675788952]
  This paper presents a semantic planar SLAM system that improves pose estimation and mapping using cues from an instance planar segmentation network. While the mainstream approaches are using RGB-D sensors, employing a monocular camera with such a system still faces challenges such as robust data association and precise geometric model fitting.
  arXiv  Detail & Related papers  (2021-08-09T18:16:08Z)
• GELATO: Geometrically Enriched Latent Model for Offline Reinforcement Learning [54.291331971813364]
  offline reinforcement learning approaches can be divided into proximal and uncertainty-aware methods. In this work, we demonstrate the benefit of combining the two in a latent variational model. Our proposed metrics measure both the quality of out of distribution samples as well as the discrepancy of examples in the data.
  arXiv  Detail & Related papers  (2021-02-22T19:42:40Z)
• Neural Topological SLAM for Visual Navigation [112.73876869904]
  We design topological representations for space that leverage semantics and afford approximate geometric reasoning. We describe supervised learning-based algorithms that can build, maintain and use such representations under noisy actuation.
  arXiv  Detail & Related papers  (2020-05-25T17:56:29Z)
• Spatial Pyramid Based Graph Reasoning for Semantic Segmentation [67.47159595239798]
  We apply graph convolution into the semantic segmentation task and propose an improved Laplacian. The graph reasoning is directly performed in the original feature space organized as a spatial pyramid. We achieve comparable performance with advantages in computational and memory overhead.
  arXiv  Detail & Related papers  (2020-03-23T12:28:07Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.