A result applicable to a particular class of branched optimization problems

Abstract Branched trajectory optimization problems can exhibit peculiar properties In the normal formulation of such problems, it is generally assumed that one should always include all trajectory segments after the branch point in the solution. In this paper, it is shown that for a certain important class of branched optimization problems, the inclusion of all trajectory segments after the branch can sometimes lead to non-optimal results