Publications

Gunther Reißig


Click on title for more information.

  1. Symbolic Optimal Control.
    Techn. Rep., 2017.
  2. Arbitrarily Precise Abstractions for Optimal Controller Synthesis.
    CDC 2017.
  3. Optimized State Space Grids for Abstractions.
    IEEE Trans. Automat. Control, vol. 62, 2017.
  4. Symbolic Synthesis with Average Performance Guarantees.
    CDC 2016.
  5. Approximate Value Iteration for a Class of Deterministic Optimal Control Problems with Infinite State and Input Alphabets.
    CDC 2016.
  6. State Space Grids for Low Complexity Abstractions.
    CDC 2015.
  7. Feedback Refinement Relations for the Synthesis of Symbolic Controllers.
    IEEE Trans. Automat. Control, vol. 62, 2017.
  8. Feedback Refinement Relations for Symbolic Controller Synthesis.
    CDC 2014.
  9. A linear time algorithm to verify strong structural controllability.
    CDC 2014.
  10. Classical and strong convexity of sublevel sets and application to attainable sets of nonlinear systems.
    SIAM J. Control Optim., vol. 52, 2014.
  11. Characterization of Sign Controllability for Linear Systems with Real Eigenvalues.
    AUCC 2013.
  12. Strongly convex attainable sets and low complexity finite-state controllers.
    AUCC 2013.
  13. Strong Structural Controllability and Observability of Linear Time-Varying Systems.
    IEEE Trans. Automat. Control, vol. 59, 2014.
  14. Abstraction-based solution of optimal stopping problems under uncertainty.
    CDC 2013.
  15. Necessary Conditions for Structural and Strong Structural Controllability of Linear Time-Varying Systems.
    ECC 2013.
  16. Sufficient Conditions for Strong Structural Controllability of Uncertain Linear Time-Varying Systems.
    ACC 2013.
  17. Characterization of Strong Structural Controllability of Uncertain Linear Time-Varying Discrete-Time Systems.
    CDC 2012.
  18. Local characterization of strongly convex sets.
    J. Math. Anal. Appl., vol. 400, 2013.
  19. Online Computation of Safety-Relevant Regions for Human Robot Interaction.
    ISR 2012.
  20. Increasing Efficiency of Optimization-based Path Planning for Robotic Manipulators.
    CDC-ECC 2011.
  21. Optimizing Motion of Robotic Manipulators Interacting with Human Operators.
    Best Paper Award.
    ICIRA 2011.
  22. Mixed-Integer Programming for Optimal Path Planning of Robotic Manipulators.
    CASE 2011.
  23. Human Arm Motion Modeling and Long-Term Prediction for Safe and Efficient Human-Robot-Interaction.
    ICRA 2011.
  24. Abstraction based solution of complex attainability problems for decomposable continuous plants.
    CDC 2010.
  25. Stabilization of Linear Dynamical Systems with Scalar Quantizers under Communication Constraints.
    CISS 2010.
  26. Computing abstractions of nonlinear systems.
    IEEE Trans. Automat. Control, vol. 56, 2011.
  27. Computation of discrete abstractions of arbitrary memory span for nonlinear sampled systems.
    HSCC 2009.
  28. Convexity of reachable sets of nonlinear discrete-time systems.
    MMAR 2007.
  29. Convexity of reachable sets of nonlinear ordinary differential equations.
    Automat. Remote Control, vol. 68, 2007.
  30. Fill reduction techniques for circuit simulation.
    Electr. Eng., vol. 90, 2007.
  31. Local fill reduction techniques for sparse symmetric linear systems.
    Electr. Eng., vol. 89, 2007.
  32. An approach to the computation of reachable sets of nonlinear dynamic systems -- an important step in generating discrete abstractions of continuous systems.
    MMAR 2005.
  33. On the maximum rank of Toeplitz block matrices of blocks of a given pattern.
    MTNS 2004.
  34. A new method for ordering sparse matrices and its performance in circuit simulation.
    ESM 2004.
  35. A simple and general method for detecting structural inconsistencies in large electrical networks.
    IEEE Trans. CAS, vol. 50, 2003.
  36. A simple and general method for detecting structural inconsistencies in large electrical networks.
    ISCAS 2002.
  37. On inconsistent initial conditions for linear time-invariant differential-algebraic equations.
    IEEE Trans. CAS, vol. 49, 2002.
  38. On inconsistent initial conditions for linear time-invariant differential-algebraic equations.
    ISCAS 2002.
  39. On singularities of autonomous implicit ordinary differential equations.
    IEEE Trans. CAS, vol. 50, 2003.
  40. On the performance of minimum degree and minimum local fill heuristics in circuit simulation.
    Techn. Rep., 2001.
  41. On methods for ordering sparse matrices in circuit simulation.
    ISCAS 2001.
  42. Method for providing error information relating to inconsistencies in a system of differential equations.
    Patent.
  43. Method for computer-aided prediction of the behavior of a system described by differential equations.
    Patent.
  44. Erweiterung eines Standard-Schaltungssimulators in Richtung VHDL-AMS.
    Analog 1999.
  45. Differential-Algebraic Equations of index 1 may have an arbitrarily high structural index.
    SIAM J. Sci. Comput., vol. 21, 2000.
  46. Beiträge zu Theorie und Anwendungen impliziter Differentialgleichungen.
    Dr.-Ing. thesis, 1997.
  47. Behavior of Multitone Signals with Schroeder's Phase.
    ICOSP 1998.
  48. The structure of BIBO stable LTI-filters - A norm type approach.
    CSDSP 1998.
  49. Structure at Infinity of Structure Matrix Pencils - A Toeplitz Matrix Approach.
    MTNS 1998.
  50. Sukzessive Index-Reduktion elektrischer Netzwerke mit Hilfe einer minimalen Anzahl von Zusatzelementen.
    Intl. Sci. Colloqu. Techn. Univ. Ilmenau, 1998.
  51. Index one regularization of networks using a minimum number of additional elements.
    SDA 1998.
  52. Eine notwendige und hinreichende Bedingung für die energetische Stabilität von zeitvarianten zeitkontinuierlichen Systemen.
    Fachtagung Informations- und Mikrosystemtechnik 1998.
  53. A normal form for implicit differential equations near singular points and its application.
    Fachtagung Informations- und Mikrosystemtechnik 1998.
  54. The index of the standard circuit equations of passive RLCTG-networks does not exceed 2.
    ISCAS 1998.
  55. Singularities of implicit ordinary differential equations.
    ISCAS 1998.
  56. An Extension of Sandberg's Representation Theorem for Linear Time-Continuous Systems.
    SMC 1998.
  57. Straightening out trajectories near singular points of implicit differential equations.
    SMC 1998.
  58. Complete characterization of all discrete-time linear systems of convolution type.
    ECCTD 1997.
  59. A Normal Form for Implicit Differential Equations Near Singular Points.
    ECCTD 1997.
  60. On Optimal Network Regularization.
    ECCTD 1997.
  61. An Extension of the Normal Tree Method.
    ECCTD 1997.
  62. Extension of the Normal Tree Method.
    Int. J. Circ. Th. Appl., vol. 27, 1999.
  63. Eine neue Methode zum Auffinden von Paaren konjugierter Bäume.
    Kleinheubacher Tagung 1996.
  64. Generische Eigenschaften linearer elektrischer Netzwerke.
    Techn. Rept., 1996.
  65. Computing the Generic Index of the Circuit Equations of Linear Active Networks.
    ISCAS 1996.
  66. Über Forward und Backward Impasse Points.
    ITG-Diskussionssitzung "Neue Anwendungen theoretischer Konzepte in der Elektrotechnik", 1995.
  67. Semi-Implicit Differential-Algebraic Equations Constitute a Normal Form.
    IEEE Trans. CAS, vol. 42, 1995.
  68. Differential-Algebraic Equations and Impasse Points.
    IEEE Trans. CAS, vol. 43, 1996.
  69. On properties of solutions of differential-algebraic equations.
    Techn. Rept., 1994.
  70. Impasse Points: Examples and Counterexamples.
    Techn. Rept., 1993.
  71. Circuit for storing sparse vectors and for cyclically reading these vectors out (in German).
    Patent.
  72. Systolic array with reduced pin numbers for the simulation of Lotka-Volterra-Systems (in German).
    Patent.
  73. Systolic array for the simulation of Lotka-Volterra-Systems (in German).
    Patent.

Impressum und Haftungsausschluß