## Abstract

In this paper, we present a method to decompose the problem of computing the backward reachable set for a dynamic system in a space of a given dimension, into a set of computational problems involving level set functions, each defined in a lower dimensional (subsystem) space. This allows the potential for great reduction in computation time. The overall system is considered as an interconnection of either disjoint or overlapping subsystems. The projection of the backward reachable set into the subsystem spaces is over-approximated by a level set of the corresponding subsystem level set function. It is shown how this method can be applied to two-player differential games. Finally, results of the computation of polytopic over-approximations of the unsafe set for the two aircraft conflict resolution problem are presented.

Original language | English (US) |
---|---|

Pages (from-to) | 399-411 |

Number of pages | 13 |

Journal | Dynamics of Continuous, Discrete and Impulsive Systems Series A: Mathematical Analysis |

Volume | 11 |

Issue number | 2-3 |

State | Published - Apr 1 2004 |

Externally published | Yes |

## Keywords

- Interconnected systems
- Over-approximations
- Reachable sets

## ASJC Scopus subject areas

- Analysis
- Discrete Mathematics and Combinatorics
- Applied Mathematics