English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Plus annual

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Tools annual

Global: Zendy Free Plan

Global: Zendy Tools monthly

Global: Zendy Plus monthly

A* algorithm is considered to be the optimal heuristic search algorithm over time. But the biggest drawback is the consumption of resources as the growth risk of the processing scale is a exponential level. This article based on common sense reasoning of artificial intelligence and the vector calculation of mathematics put forward three strategies to optimize the number of intermediate nodes and the calculation times of heuristic function. These strategies make the computer in the process of pathfinding closer to human thinking. By comparison with the experimental data with the traditional algorithm, the result show that runtime is generally reduced by 40%~70% and count of intermediate node is reduced by 30%~60%. And exponential growth risk is also effectively reduced.

A optimization of A* algorithm to make it close to human pathfinding behavior