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 Plus monthly

Global: Zendy Tools annual

Global: Zendy Tools monthly

Global: Zendy Free Plan

For the path optimization problem on the irregular surface of three-dimension, three-dimensional surface is discretized with grid. Based on the parallel character of cellular automata in the cellular space, with the dynamic cellular neighbors , the time evolution interval is defined as the minimum remaining weight. The new shortest path algorithm is structured, based on cellular automaton model. That is to say, through the simple rules of evolution of cellular state, the shortest path is got. The method can achieve the efficiency of ant colony algorithm, and a new way of application of the Cellular Automata model is provided. </p

Study for solving the path on the three-dimensional surface based on Cellular Automata method