Input, management, and display of taxi routes on airport moving map displays (AMM) have been covered in various
studies in the past. The demonstrated applications are typically based on Aerodrome Mapping Databases (AMDB). Taxi
routing functions require specific enhancements, typically in the form of a graph network with nodes and edges modeling
all connectivities within an airport, which are not supported by the current AMDB standards. Therefore, the data
schemas and data content have been defined specifically for the purpose and test scenarios of these studies.
A standardization of the data format for taxi routing information is a prerequisite for turning taxi routing functions into
production. The joint RTCA/EUROCAE special committee SC-217, responsible for updating and enhancing the AMDB
standards DO-272  and DO-291 , is currently in the process of studying different alternatives and defining
Requirements for taxi routing data are primarily driven by depiction concepts for assigned and cleared taxi routes, but
also by database size and the economic feasibility. Studied concepts are similar to the ones described in the GDF
(geographic data files) specification , which is used in most car navigation systems today. They include
- A highly aggregated graph network of complex features
- A modestly aggregated graph network of simple features
- A non-explicit topology of plain AMDB taxi guidance line elements
This paper introduces the different concepts and their advantages and disadvantages.