Design Of D_Timetable And Application In Track And Field Meets Management System

Temporal-Planning is the special schedule area in artificial intelligence accordingas restriction of Temporal-Relation. In real life, many problems belong to thiscategory. Arrangement of track and field meets schedule is just a representative one.Nowadays, most track and field meets management systems are not able togenerate the schedule automatically. To fill the vacancy, we do some research onsolutions to Temporal-Planning, and advance a scheme to generate the schedule byD_Timetable Algorithm. We also develop a school track and field meets managementsystem to carry out the scheme.We focus our mind on the following aspects:(?)Based on Temporal World Model, the content of Temporal-Relation-Matrixand the concrete representations of 13 different relations are introduced.Then, with Temporal-Relation-Matrix, the basic thought and flow ofD_Timetable algorithm which meets the constraint of temporal order andwidth congruously are explained. Aimed at the problems that can not besolved by this algorithm directly, we advance the conception ofvacancy-added and point-adjusted to expand its sphere of application.(?)A reasonable schedule has to satisfy the constraint of temporal order andwidth congruously. We analyze the feasibility of generating the schedule byD_Timetable Algorithm, and advance the specific scheme.(?)A school track and field meets management system which realizes theforenamed scheme is developed. Applied in an instance, it generates abasically satisfied schedule.The researches and discussions in this paper aim at Temporal-Planning problemsunder the relation constraints of single component. The application in the systemaffirms the feasibility of the scheme, and further provesthat those problems can besolved effectively by D_Timetable algorithm. However, Temporal-Planning problemsunder the relation constraints of multiple components are not able to be solved well byit. We will do further research on it in the future.