Symmetry in Evolutionary Computation and Reinforcement Learning

A special issue of Symmetry (ISSN 2073-8994). This special issue belongs to the section "Computer".

Deadline for manuscript submissions: 30 April 2025 | Viewed by 1930

Special Issue Editors


E-Mail Website
Guest Editor
Key Laboratory of Collaborative Intelligence Systems, Xidian University, Xi’an 710071, China
Interests: intelligent optimization; resource scheduling; task planning
Special Issues, Collections and Topics in MDPI journals

E-Mail Website
Guest Editor
Wuyi Intelligent Manufacturing Institute of Industrial Technology, Jinhua 321017, China
Interests: scheduling; evolutionary algorithm; reinforcement learning; computational intelligence

E-Mail Website
Guest Editor
School of Computer Science and School of Cyberspace Security, Xiangtan University, Xiangtan 411105, China
Interests: evolutionary computation; multi-objective optimization; reinforcement learning; satellite scheduling

E-Mail Website
Guest Editor
Key Laboratory of Collaborative Intelligence Systems, Xidian University, Xi’an 710071, China
Interests: data-driven optimization algorithm; combinatorial optimization; satellite task scheduling

Special Issue Information

Dear Colleagues,

Evolutionary computation and reinforcement learning are two distinct but related fields in machine learning and optimization. Symmetry is an important concept that has been studied in the fields of evolutionary computation and reinforcement learning. In evolutionary computation, symmetry can be exploited to improve the efficiency and performance of optimization algorithms. Symmetric representations of candidate solutions can reduce the search space and allow for more effective exploration. Researchers have investigated ways to incorporate symmetry into genetic algorithms, evolution strategies, and other evolutionary techniques. In reinforcement learning, symmetry can be leveraged to generalize learning across similar states or actions. If an agent encounters a state that is symmetric to a previously visited state, it can apply the same learned policy or value function.

The interplay between evolutionary computation and reinforcement learning, combined with the consideration of symmetry, has led to advancements in various applications, including robotics, cryptography, and optimization.

Prof. Dr. Lining Xing
Dr. Yanjie Song
Dr. Junwei Ou
Dr. Jian Wu
Guest Editors

Yue Zhang
Guest Editor Assistant

Manuscript Submission Information

Manuscripts should be submitted online at www.mdpi.com by registering and logging in to this website. Once you are registered, click here to go to the submission form. Manuscripts can be submitted until the deadline. All submissions that pass pre-check are peer-reviewed. Accepted papers will be published continuously in the journal (as soon as accepted) and will be listed together on the special issue website. Research articles, review articles as well as short communications are invited. For planned papers, a title and short abstract (about 100 words) can be sent to the Editorial Office for announcement on this website.

Submitted manuscripts should not have been published previously, nor be under consideration for publication elsewhere (except conference proceedings papers). All manuscripts are thoroughly refereed through a single-blind peer-review process. A guide for authors and other relevant information for submission of manuscripts is available on the Instructions for Authors page. Symmetry is an international peer-reviewed open access monthly journal published by MDPI.

Please visit the Instructions for Authors page before submitting a manuscript. The Article Processing Charge (APC) for publication in this open access journal is 2400 CHF (Swiss Francs). Submitted papers should be well formatted and use good English. Authors may use MDPI's English editing service prior to publication or during author revisions.

Keywords

  • evolutionary computation
  • reinforcement learning
  • optimization robotics
  • cryptography

Benefits of Publishing in a Special Issue

  • Ease of navigation: Grouping papers by topic helps scholars navigate broad scope journals more efficiently.
  • Greater discoverability: Special Issues support the reach and impact of scientific research. Articles in Special Issues are more discoverable and cited more frequently.
  • Expansion of research network: Special Issues facilitate connections among authors, fostering scientific collaborations.
  • External promotion: Articles in Special Issues are often promoted through the journal's social media, increasing their visibility.
  • e-Book format: Special Issues with more than 10 articles can be published as dedicated e-books, ensuring wide and rapid dissemination.

Further information on MDPI's Special Issue polices can be found here.

Published Papers (1 paper)

Order results
Result details
Select all
Export citation of selected articles as:

Research

21 pages, 80623 KiB  
Article
Research on Path Planning for Intelligent Mobile Robots Based on Improved A* Algorithm
by Dexian Wang, Qilong Liu, Jinghui Yang and Delin Huang
Symmetry 2024, 16(10), 1311; https://doi.org/10.3390/sym16101311 - 4 Oct 2024
Viewed by 1711
Abstract
Intelligent mobile robots have been gradually used in various fields, including logistics, healthcare, service, and maintenance. Path planning is a crucial aspect of intelligent mobile robot research, which aims to empower robots to create optimal trajectories within complex and dynamic environments autonomously. This [...] Read more.
Intelligent mobile robots have been gradually used in various fields, including logistics, healthcare, service, and maintenance. Path planning is a crucial aspect of intelligent mobile robot research, which aims to empower robots to create optimal trajectories within complex and dynamic environments autonomously. This study introduces an improved A* algorithm to address the challenges faced by the preliminary A* pathfinding algorithm, which include limited efficiency, inadequate robustness, and excessive node traversal. Firstly, the node storage structure is optimized using a minimum heap to decrease node traversal time. In addition, the heuristic function is improved by adding an adaptive weight function and a turn penalty function. The original 8-neighbor is expanded to a 16-neighbor within the search strategy, followed by the elimination of invalid search neighbor to refine it into a new 8-neighbor according to the principle of symmetry, thereby enhancing the directionality of the A* algorithm and improving search efficiency. Furthermore, a bidirectional search mechanism is implemented to further reduce search time. Finally, trajectory optimization is performed on the planned paths using path node elimination and cubic Bezier curves, which aligns the optimized paths more closely with the kinematic constraints of the robot derivable trajectories. In simulation experiments on grid maps of different sizes, it was demonstrated that the proposed improved A* algorithm outperforms the preliminary A* Algorithm in various metrics, such as search efficiency, node traversal count, path length, and inflection points. The improved algorithm provides substantial value for practical applications by efficiently planning optimal paths in complex environments and ensuring robot drivability. Full article
(This article belongs to the Special Issue Symmetry in Evolutionary Computation and Reinforcement Learning)
Show Figures

Figure 1

Back to TopTop