Lagrangian based A* algorithm for automated reasoning

Renju Rajan
6/28/2023
cs.AI

No confident code implementation found for this paper. 1 possible match can be shown below.

Abstract

In this paper, a modification of A* algorithm is considered for the shortest path problem. A weightage is introduced in the heuristic part of the A* algorithm to improve its efficiency. An application of the algorithm is considered for UAV path planning wherein velocity is taken as the weigtage to the heuristic. At the outset, calculus of variations based Lagrange's equation was used to identify velocity as the decisive factor for the dynamical system. This approach would be useful for other problems as well to improve the efficiency of algorithms in those areas.

View on arXivView PDF

Code Implementations

No confident code match yet

We couldn't find an author-owned or strongly-evidenced community implementation for this paper. 1 weaker match is hidden by default — verify before relying on them.

No code implementations found yet.

Know of an implementation? Let us know in the comments below!

Similar Papers

Counterfactual Routing Using Integer Programming with Constraint Generation

79% match2026

Logic-Constrained Shortest Paths for Flight Planning

78% match2024

Tightest Admissible Shortest Path

78% match2023

Route Planning Using Nature-Inspired Algorithms

76% match2023

Hybrid Reinforcement Learning and Search for Flight Trajectory Planning

75% match2025

Pruning Long Chain-of-Thought of Large Reasoning Models via Small-Scale Preference Optimization

75% match2025

Cite this paper

@article{rajan2023lagrangian,
  title  = {Lagrangian based A* algorithm for automated reasoning},
  author = {Renju Rajan},
  year   = {2023},
  eprint = {2306.16368},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2306.16368v1}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2306.16368.svg)](https://codeofpaper.com/paper/2306.16368)

Discussion