Entropy-based Optimization via A* Algorithm for Parking Space Recommendation

• URL: http://arxiv.org/abs/2104.09461v1
• Date: Mon, 19 Apr 2021 17:24:51 GMT
• Title: Entropy-based Optimization via A* Algorithm for Parking Space Recommendation
• Authors: Xin Wei, Runqi Qiu, Houyu Yu, Yurun Yang, Haoyu Tian, Xiang Xiang
• Abstract summary: Our approach is based on the entropy method and realized by the A* algorithm. Experiments have shown that the combination of A* and the entropy value induces the optimal parking solution with the shortest route.
• Score: 6.778914204495013
• License: http://creativecommons.org/licenses/by-nc-nd/4.0/
• Abstract: This paper addresses the path planning problems for recommending parking spaces, given the difficulties of identifying the most optimal route to vacant parking spaces and the shortest time to leave the parking space. Our optimization approach is based on the entropy method and realized by the A* algorithm. Experiments have shown that the combination of A* and the entropy value induces the optimal parking solution with the shortest route while being robust to environmental factors.

Related papers

• PSO and the Traveling Salesman Problem: An Intelligent Optimization Approach [0.0]
  The Traveling Salesman Problem (TSP) is an optimization problem that aims to find the shortest possible route that visits each city exactly once and returns to the starting point. This paper explores the application of Particle Swarm Optimization (PSO), a population-based optimization algorithm, to solve TSP.
  arXiv  Detail & Related papers  (2025-01-25T20:21:31Z)
• Research on Travel Route Planing Problems Based on Greedy Algorithm [0.0]
  Route planning problem based on the greedy algorithm represents a method of identifying the optimal or near-optimal route between a given start point and end point. In this paper, the PCA method is employed initially to downscale the city evaluation indexes, extract the key principal components, and then downscale the data. A route planning algorithm is proposed and optimised based on the greedy algorithm, which provides personalised route customisation according to the different needs of tourists.
  arXiv  Detail & Related papers  (2024-10-17T05:17:01Z)
• LLM-A*: Large Language Model Enhanced Incremental Heuristic Search on Path Planning [91.95362946266577]
  Path planning is a fundamental scientific problem in robotics and autonomous navigation. Traditional algorithms like A* and its variants are capable of ensuring path validity but suffer from significant computational and memory inefficiencies as the state space grows. We propose a new LLM based route planning method that synergistically combines the precise pathfinding capabilities of A* with the global reasoning capability of LLMs. This hybrid approach aims to enhance pathfinding efficiency in terms of time and space complexity while maintaining the integrity of path validity, especially in large-scale scenarios.
  arXiv  Detail & Related papers  (2024-06-20T01:24:30Z)
• Automated Parking Planning with Vision-Based BEV Approach [10.936433798200907]
  This paper proposes an improved automated parking algorithm based on the A* algorithm, integrating vehicle kinematic models, function optimization, bidirectional search, and Bezier curve optimization. Compared to traditional algorithms, this approach demonstrates reduced computation time with more challenging collision-risk test cases and improved performance in comfort metrics.
  arXiv  Detail & Related papers  (2024-05-24T15:26:09Z)
• Fast Computation of Optimal Transport via Entropy-Regularized Extragradient Methods [75.34939761152587]
  Efficient computation of the optimal transport distance between two distributions serves as an algorithm that empowers various applications. This paper develops a scalable first-order optimization-based method that computes optimal transport to within $varepsilon$ additive accuracy.
  arXiv  Detail & Related papers  (2023-01-30T15:46:39Z)
• Non-Convex Optimization with Certificates and Fast Rates Through Kernel Sums of Squares [68.8204255655161]
  We consider potentially non- optimized approximation problems. In this paper, we propose an algorithm that achieves close to optimal a priori computational guarantees.
  arXiv  Detail & Related papers  (2022-04-11T09:37:04Z)
• Model-based Decision Making with Imagination for Autonomous Parking [50.41076449007115]
  The proposed algorithm consists of three parts: an imaginative model for anticipating results before parking, an improved rapid-exploring random tree (RRT) and a path smoothing module. Our algorithm is based on a real kinematic vehicle model; which makes it more suitable for algorithm application on real autonomous cars. In order to evaluate the algorithm's effectiveness, we have compared our algorithm with traditional RRT, within three different parking scenarios.
  arXiv  Detail & Related papers  (2021-08-25T18:24:34Z)
• MoParkeR : Multi-objective Parking Recommendation [5.970994932728028]
  Existing parking recommendation solutions mainly focus on finding and suggesting parking spaces based on the unoccupied options only. More importantly, these factors may change over time and conflict with each other which makes the recommendations produced by current parking recommender systems ineffective. We present a solution by designing a multi-objective parking recommendation engine called MoParkeR that considers various conflicting factors together.
  arXiv  Detail & Related papers  (2021-06-10T10:57:09Z)
• A Hybrid Multi-Objective Carpool Route Optimization Technique using Genetic Algorithm and A* Algorithm [0.0]
  This work presents a hybrid GA-A* algorithm to obtain optimal routes for the carpooling problem. The routes obtained maximize the profit of the service provider by minimizing the travel and detour distance as well as pick-up/drop costs. The proposed algorithm has been implemented over the Salt Lake area of Kolkata.
  arXiv  Detail & Related papers  (2020-07-11T14:13:20Z)
• Feature Robust Optimal Transport for High-dimensional Data [125.04654605998618]
  We propose feature-robust optimal transport (FROT) for high-dimensional data, which solves high-dimensional OT problems using feature selection to avoid the curse of dimensionality. We show that the FROT algorithm achieves state-of-the-art performance in real-world semantic correspondence datasets.
  arXiv  Detail & Related papers  (2020-05-25T14:07:16Z)
• Private Stochastic Convex Optimization: Optimal Rates in Linear Time [74.47681868973598]
  We study the problem of minimizing the population loss given i.i.d. samples from a distribution over convex loss functions. A recent work of Bassily et al. has established the optimal bound on the excess population loss achievable given $n$ samples. We describe two new techniques for deriving convex optimization algorithms both achieving the optimal bound on excess loss and using $O(minn, n2/d)$ gradient computations.
  arXiv  Detail & Related papers  (2020-05-10T19:52:03Z)
• Bayesian Hierarchical Multi-Objective Optimization for Vehicle Parking Route Discovery [0.0]
  This paper proposes a Bayesian hierarchical technique for obtaining the most optimal route to a parking lot. A probabilistic data driven method has been used to overcome the inherent problem of weight selection in the popular weighted sum technique. Genetic algorithm has been used to obtain optimal solutions.
  arXiv  Detail & Related papers  (2020-03-27T16:15:53Z)

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.