Genetic Programming with Guaranteed Constraints

Johnson, Colin G. (2002) Genetic Programming with Guaranteed Constraints. In: Recent Advances in Soft Computing, December 12-13, 2002, Nottingham Trent University, England.

PDF
Download (123Kb)	Preview

Abstract

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:	Faculties > Science Technology and Medical Studies > School of Computing > Applied and Interdisciplinary Informatics Group
Depositing User:	Mark Wheadon
Date Deposited:	24 Nov 2008 17:59
Last Modified:	08 Jun 2012 14:27
Resource URI:	http://kar.kent.ac.uk/id/eprint/13686 (The current URI for this page, for reference purposes)

• Depositors only (login required):