Generating complete all-day activity plans with genetic algorithms
نویسندگان
چکیده
منابع مشابه
Generating Rhythms with Genetic Algorithms
My system uses an interactive genetic algorithm to learn a user’s criteria for the task of generating musical rhythms. Interactive genetic algorithms (Smith 91) are well suited to solving this problem because they allow for a user to simply execute fitness functions (that is, to choose which rhythms or features of rhythms he likes), without necessarily understanding the details or parameters of...
متن کاملImproving tactical plans with genetic algorithms
The problem of learning decision rules for sequential tasks is addressed, focusing on the problem of learning tactical plans from a simple flight simulator where a plane must avoid a missile. The learning method relies on the notion of competition and employs genetic algorithms to search the space of decision policies. In the research presented here, the use of available heuristic domain knowle...
متن کاملGenerating Complete Query Plans given Approximate Descriptions of Content Providers
Information brokers can use information available from content providers to answer complex user queries. To accomplish this task they need descriptions of the domains of content providers. Domains can often be described only approximately by giving lower and upper bounds on the data available, because exact descriptions might be too complex and ineecient to deal with. This paper presents an alg...
متن کاملGenerating Arachnid Robot Gaits with Cyclic Genetic Algorithms
Learning gaits for walking robots is difficult because the elements of control require repetition of a sequence of integrated steps. Controllers for the six-legged robots, such as the Stiquito, and the eight-legged spider robots, in development, exemplify the difficulties of evolving gaits. The controllers for these robots store the actuator commands in a field-programmable gate array as a list...
متن کاملGenetic algorithms for generating minimum path configurations
Solving a problem on a distributed memory multiprocessor system requires the individual processors to co-operate when necessary, by exchanging messages. These messages are transferred between processors across links which interconnect the processors. If the number of links available at each processor is not restricted then the system may be fully interconnected, having a maximumdistance between...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Transportation
سال: 2005
ISSN: 0049-4488,1572-9435
DOI: 10.1007/s11116-004-8287-y