dymos
dymos copied to clipboard
OpenMDAO
Open Source Optimization of Dynamic Multidisciplinary Systems
Define an AnalyticPhase for which the solution to the ODE is known analytically. Rather than taking an ODE, take a system that provides a solution for any time. This would...
### Issue Type - [ ] Bug - [x] Enhancement - [ ] Docs - [ ] Miscellaneous ### Description We currently have a case where the final time of...
### Issue Type - [x] Bug - [ ] Enhancement - [ ] Docs - [ ] Miscellaneous ### Description The GaussLobatto transcription relies on specifying the states at the...
### Issue Type - [ ] Bug - [ ] Enhancement - [x] Docs - [ ] Miscellaneous ### Description This should be doable with the Betts reentry problem. See...
### Summary The dense block in the Birkhoff transcription's sparsity pattern is due to a matrix used to compute the state defects as a function of the state rates. This...
### Description The birkhoff transcription uses a single, often high-order polynomial segment to represent the states. Dymos often assumes this same polynomial basis represents the controls. For simulation and explicit...
### Proposed feature. The Birkhoff transcription duplicates several inputs for the sake of improving the conditioning of the corresponding optimization problem. X: state values at all nodes (including the initial...
### Proposed feature. The following collocation defects exist for the Birkhoff transcription: ``` state_defect = np.einsum('ij,jk...->ik...', self._A, XV) - \ np.einsum('ij, j...->i...', self._C, x_ab.reshape((2 * num_segs,) + shape)) outputs[var_names['state_defect']] =...
### Proposed feature. Many simple dynamic systems can be represented in state space form. $$\dot{x} = [A] \bar{x} + [B] \bar{y}$$ $$y = [C] \bar{x} + [B] \bar{y} $$ This...
### Description Set duration bounds relies on the residual variable being a dependent upon the phase duration. When pseudospectral phases are being solved by the optimizer, there is no direct...