Proposed in 1931, the Zermelo's navigation problem is a classic optimal control problem. The problems deals with a boat navigating on a body of water, originating from a point O to a destination point D. The boat is capable of a certain maximum speed, and we want to derive the best possible control to reach D in the least possible time.
Name:
Anonymous2013-09-01 15:51
A set is pure if all of its members are sets, all members of its members are sets, and so on. For example, the set {{}} containing only the empty set is a nonempty pure set.