Skip to main content
Kent Academic Repository

Genetic Programming with Guaranteed Constraints

Johnson, Colin G. (2002) Genetic Programming with Guaranteed Constraints. In: Lofti, A. and John, B. and Garibaldi, J., eds. Recent Advances in Soft Computing. . Physica/Springer-Verlag (KAR id:13686)


Genetic programming is a powerful technique for automatically generating program code from a description of the desired functionality. However it is frequently distrusted by users because the programs are generated with reference to a training set, and there is no formal guarantee that the generated programs will operate as intended outside of this training set. This paper describes a way of including constraints into the fitness function of a genetic programming system, so that the evolution is guided towards a solution which satisfies those constraints and so that a check can be made when a solution satisfies those constraints. This is applied to a problem in mobile robotics.

Item Type: Conference or workshop item (Paper)
Uncontrolled keywords: genetic programming, automatic programming, safety, static analysis, program analysis, mobile robotics
Subjects: Q Science > QA Mathematics (inc Computing science) > QA 76 Software, computer programming,
Divisions: Divisions > Division of Computing, Engineering and Mathematical Sciences > School of Computing
Depositing User: Mark Wheadon
Date Deposited: 24 Nov 2008 17:59 UTC
Last Modified: 16 Nov 2021 09:51 UTC
Resource URI: (The current URI for this page, for reference purposes)

University of Kent Author Information

  • Depositors only (login required):

Total unique views for this document in KAR since July 2020. For more details click on the image.