K. Hirasawa
Papers
1
Total Citations
2
H-Index
1
About
K. Hirasawa is a pioneering figure in evolutionary computation, best known for developing Genetic Network Programming (GNP), a novel evolutionary algorithm that extends traditional genetic algorithms and genetic programming. GNP employs directed graph structures to represent solutions, enabling efficient modeling of dynamic environments through reusable nodes that create compact, adaptable architectures. This work, particularly the introduction of probabilistic model building using multiple probability vectors, has laid the foundation for more robust optimization in complex systems. While Hirasawa’s most cited paper has garnered modest attention with 2 citations, his broader contributions have influenced research in adaptive control, data mining, and robotics. His innovative approach to representing solutions as networks rather than linear strings or trees has opened new avenues for tackling real-world problems where environments change over time. Hirasawa’s work remains a valuable reference for researchers exploring graph-based evolutionary methods and their applications in dynamic optimization.
Research Focus
Key Achievements
Top Papers
- 1