Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Héctor J. Sussmann

dblp:82/1587 · DBLP profile ↗
← Back
7ranked-venue papers
4as first author
0since 2021 · last 1992
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Artificial intelligence and machine learning · 4 · 1 first-authorTheory of computation · 3 · 3 first-authorSystems, architecture and hardware · 2

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Computer architecture, parallel and distributed computing, and storage systems
1 paper
Emerging computing paradigms · 100%
Artificial intelligence
1 paper
Motion planning and robot control · 100%
Theoretical computer science
2 papers
Information theory · 60% Mathematical optimization · 40%

Topics — the 8 heaviest of 8, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Emerging computing paradigms › neuromorphic computing
associative memory
0.011989
On the number of memories that can be perfectly stored in a neural net with Hebb weights · IEEE Trans. Inf. Theory 1989
Emerging computing paradigms › neural computing
neural network theory
0.011989
On the number of memories that can be perfectly stored in a neural net with Hebb weights · IEEE Trans. Inf. Theory 1989
Robotics › Motion planning and robot control
robot control
0.011986
Time-optimal control of manipulators · ICRA 1986
Robotics › Motion planning and robot control › robot control › optimal control
time-optimal control
0.011986
Time-optimal control of manipulators · ICRA 1986
Information theory › channel capacity
capacity bounds
0.011989
On the number of memories that can be perfectly stored in a neural net with Hebb weights · IEEE Trans. Inf. Theory 1989
Information theory › information measures
entropy
0.011989
On the number of memories that can be perfectly stored in a neural net with Hebb weights · IEEE Trans. Inf. Theory 1989
Mathematical optimization › control theory
nonlinear systems control
0.011986
Time-optimal control of manipulators · ICRA 1986
Mathematical optimization › control theory
optimal control
0.011986
Time-optimal control of manipulators · ICRA 1986

Methods — techniques the papers use, named apart from their topics

probabilistic analysis · 0.0hebb rule · 0.0nonlinear systems analysis · 0.0non-linear systems analysis · 0.0
YearPublicationVenuePosition
1992 Uniqueness of the weights for minimal feedforward nets with a given input-output map
Héctor J. Sussmann
Neural Networks1
1991 Motion planning for controllable systems without drift
abstract
A general strategy for solving the motion planning problem for real analytic, controllable systems without drift is proposed. The procedure starts by computing a control that steers the given initial point to the desired target point for an extended system, in which a number of Lie brackets of the system vector fields are added. Using formal calculations with a product expansion relative to P. Hall basis, another control is produced that achieves the desired result on the formal level. This provides an exact solution of the original problem if the given system is nilpotent. For a general system, an iterative algorithm is derived that converges very quickly to a solution. For nonnilpotent systems which are feedback nilpotentizable, the algorithm, in cascade with a precompensator, produces an exact solution. Results of simulations which illustrate the effectiveness of the procedure are presented.>
Gerardo Lafferriere, Héctor J. Sussmann
ICRA2
1991 Back propagation separates where perceptrons do
Eduardo D. Sontag, Héctor J. Sussmann
Neural Networks2
1989 On the number of memories that can be perfectly stored in a neural net with Hebb weights
abstract
Let (w/sub ij/) be the weights of the connections of a neural network with n nodes, calculated from m data vectors v/sup 1/, ..., v/sup m/ in (1,-1)/sup n/, according to the Hebb rule. The author proves that if m is not too large relative to n and the v/sup k/ are random, then the w/sub ij/ constitute, with high probability, a perfect representation of the v/sup k/ in the sense that the v/sup k/ are completely determined by the w/sub ij/ up to their sign. The conditions under which this is established turn out to be less restrictive than those under which it has been shown that the v/sup k/ can actually be recovered by letting the network evolve until equilibrium is attained. In the specific case where the entries of the v/sup k/ are independent and equal to 1 or -1 with probability 1/2, the condition on m is that m should not exceed n/0.7 log n.>
Héctor J. Sussmann
IEEE Trans. Inf. Theory1
1986 Time-optimal control of manipulators
abstract
This paper studies time-optimal control questions for a certain class of nonlinear systems. This class includes a large number of mechanical systems, in particular, rigid robotic manipulators with torque constraints. As nonlinear systems, these systems have many properties that are false for generic systems of the same dimensions.
Eduardo D. Sontag, Héctor J. Sussmann
ICRA2
1979 Single-Input Observability of Continuous-Time Systems
Héctor J. Sussmann
Math. Syst. Theory1
1977 Existence and Uniqueness of Minimal Realizations of Nonlinear Systems
Héctor J. Sussmann
Math. Syst. Theory1