Contents

p1

Chapter1 Introduction

p1

Chapter2 Dynamic programming formulation for associative optimal path problems

p9

1 Introduction

p9

2 Existence and uniqueness

p11

3 Successive approximation method

p19

Chapter3 Bynamic programming formulation for associative optimal path problems

p26

1 Introduction

p26

2 Existence and uniqueness

p28

3 Bidecision algorithm

p38

Chapter4 On a negative-equivalency theorem in associative optimal path problems

p45

1 Introduction

p45

2 Bitonic semigroup

p46

3 Problem and formulation

p50

4 Negative-equivalency theorem

p53

5 Discussion

p59

Chapter5 An invariant imbedding approach to associative shortest path problems

p62

1 Introduction

p62

2 Formulation and uniqueness

p64

3 Recursive equations and separability

p67

4 Successive approximation method

p71

Acknowledgements

p77