Patent Grant
9792546
This application is related to co-pending and co-owned U.S. patent application Ser. No. 13/918,338 entitled “ROBOTIC TRAINING APPARATUS AND METHODS”, filed herewith, U.S. patent application Ser. No. 13/918,620 entitled “PREDICTIVE ROBOTIC CONTROLLER APPARATUS AND METHODS”, filed herewith, U.S. patent application Ser. No. 13/907,734 entitled “ADAPTIVE ROBOTIC INTERFACE APPARATUS AND METHODS”, filed May 31, 2013, U.S. patent application Ser. No. 13/842,530 entitled “ADAPTIVE PREDICTOR APPARATUS AND METHODS”, filed Mar. 15, 2013, U.S. patent application Ser. No. 13/842,562 entitled “ADAPTIVE PREDICTOR APPARATUS AND METHODS FOR ROBOTIC CONTROL”, filed Mar. 15, 2013, U.S. patent application Ser. No. 13/842,616 entitled “ROBOTIC APPARATUS AND METHODS FOR DEVELOPING A HIERARCHY OF MOTOR PRIMITIVES”, filed Mar. 15, 2013, U.S. patent application Ser. No. 13/842,647 entitled “MULTICHANNEL ROBOTIC CONTROLLER APPARATUS AND METHODS”, filed Mar. 15, 2013, and U.S. patent application Ser. No. 13/842,583 entitled “APPARATUS AND METHODS FOR TRAINING OF ROBOTIC DEVICES”, filed Mar. 15, 2013, each of the foregoing being incorporated herein by reference in its entirety.
A portion of the disclosure of this patent document contains material that is subject to copyright protection. The copyright owner has no objection to the facsimile reproduction by anyone of the patent document or the patent disclosure, as it appears in the Patent and Trademark Office patent files or records, but otherwise reserves all copyright rights whatsoever.
Technological Field
The present disclosure relates to adaptive control and training of robotic devices.
Background
Robotic devices are used in a variety of applications, such as manufacturing, medical, safety, military, exploration, and/or other applications. Some existing robotic devices (e.g., manufacturing assembly and/or packaging) may be programmed in order to perform desired functionality. Some robotic devices (e.g., surgical robots) may be remotely controlled by humans, while some robots (e.g., iRobot Roomba®) may learn to operate via exploration.
Programming robots may be costly and remote control may require a human operator. Furthermore, changes in the robot model and/or environment may require changes in the programming code. Remote control typically relies on user experience and/or agility that may be inadequate when dynamics of the control system and/or environment (e.g., an unexpected obstacle appears in path of a remotely controlled vehicle) change rapidly.
One aspect of the disclosure relates to a method of a non-transitory computer readable medium having instructions embodied thereon. The instructions may be executable by a processor to perform a method for controlling a robotic platform. The method may comprise: based on a detection of a sequence of control actions comprising two or more activations of the robotic platform, generating a composite control element, the composite control element being configured to execute the sequence.
In some implementations, the sequence may be configured to cause the robotic platform to execute a target task. Individual ones of the two or more activations may be based on a user issuing two or more control commands via a remote control interface. The composite control element may be configured to execute the task responsive to a single activation of the composite control element by the user.
In some implementations, individual ones of the two or more control commands may comprise multiple instances of a given control operation effectuated based on multiple activations of a first control element associated with the remote control interface.
In some implementations, individual ones of the two or more control commands may comprise one or more instances of two or more control operation effectuated based on activations of a first control element and a second control element associated with the remote control interface. The single activation may be configured to obviate the activations of the first control element and the second control element by the user.
In some implementations, the user comprises a human. The detection may be configured based on a request by the user.
In some implementations, individual ones of the sequence of control actions may be configured based on a control signal generated by a controller of the robotic platform based on a sensory context and user input. The control signal generation may be effectuated by a learning process comprising adjusting a learning parameter based on a performance measure. The performance measure may be configured based on individual ones of the sequence of control actions and the target action. The detection may be effectuated based on an indication provided by the learning process absent user request.
In some implementations, the platform may comprise at least one actuator. The activation may comprise activating the least one actuator at two or more instances of time. The instances may be separated by a time period.
In some implementations, the learning process may comprise execution of multiple trials. Individual ones of the multiple trials may be characterized by trial duration. Individual ones of the sequence of control actions may correspond to an execution of a given trial of the multiple trials. The time period may correspond to the trial duration.
In some implementations, the robotic platform may comprise two or more individually controllable actuators. The activation may comprise activating individual ones of the two or more actuators.
Another aspect of the disclosure relates to a remote control apparatus of a robot. The apparatus may comprise a processor, a sensor, a user interface, and a remote communications interface. The processor may be configured to operate a learning process. The sensor may be coupled to the processor. The user interface may be configured to present one or more human perceptible control elements. The remote communications interface may be configured to communicate to the robot a plurality of control commands configured by the learning process based on an association between the sensor input and individual ones of a plurality of user inputs provided via one or more of the one or more human perceptible control elements. The communication to the robot of the plurality of control command may be configured to cause the robot to execute a plurality of actions. The learning process may be configured based on a performance measure between a target action and individual ones of the plurality of actions. The association between the sensor input and individual ones of a plurality of actions may be configured to cause generation of one or more of control primitives. Individual ones of the plurality of control primitives may be configured to cause execution of a respective action of the plurality of actions.
In some implementations, the learning process may be configured to generate a composite control based on a detection of the provision of individual ones of a plurality of user inputs. An individual action of the plurality of actions may correspond to execution of the task.
In some implementations, the learning process may be configured to generate a composite control based on a request by the user. The composite control may be configured to actuate the plurality of actions thereby causing an execution of the target action responsive to a single activation by the user.
In some implementations, the learning parameter adjustment may be configured based on a supervised learning process. The supervised learning process may be configured based on the sensory context and a combination of the control signal and the user input.
In some implementations, the composite control generation may comprise presenting an additional human perceptible control element configured to cause activation of the composite control by the use. Activation of the composite control may be configured based on detecting one or more of an audio signal, a touch signal, and an electrical signal by the user interface.
In some implementations, provision of individual ones of the plurality of user inputs may be configured based on the user issuing an audible tag or a touch indication to the user interface.
In some implementations, the audio signal may be configured based on an audible tag issued by the user. The tag may have a characteristic associated therewith. The detecting one or more of the audio signal, the touch signal, and the electrical signal by the user interface may be configured based on a match between the characteristic and a parameter associated with the generation of the composite control.
In some implementations, the target action may be characterized by a plurality of terms in a human language. The audible tag may comprise a voice command that is not required to have a common meaning as individual ones of the plurality of terms.
In some implementations, the audible tag may comprise one or more of a voice command or a clap sequence. The parameter may comprise a spectrogram.
In some implementations, the user interface may comprise a touch sensitive interface. The touch signal may be configured based on a pattern provided by the user via the touch interface.
In some implementations, the user interface may comprise a camera. The electrical signal may be configured based on capturing a representation of the user by the camera.
Yet another aspect of the disclosure relates to a method for controlling a robot to execute a task. The method may comprise: based on a first indication received from a user, executing a plurality of actions, individual ones of the plurality of actions being configured based on sensory input and a given user input of a plurality of user inputs; and based on a second indication received from a user, associating a control component with the task, the control component being characterized by provision of a user discernible representation. The execution of the plurality of actions may be configured to effectuate execution of the task by the robot. Activation by the user of the control component using the user discernible representation may be configured to cause the robot to execute the task.
In some implementations, the provision of the user discernible representation may comprise: disposing an icon on a display; and configuring a user interface device to receive input based on the user action configured in accordance with the icon.
In another aspect of the present disclosure, a non-transitory computer readable medium is disclosed. In one embodiment, the non-transitory computer readable medium has instructions embodied thereon, where the instructions are configured to, when executed by a physical processor, cause the physical processor to: based on a detection of a sequence of discrete control actions comprising two or more activations of a robotic apparatus by a user, generate a composite control element, the composite control element being configured to execute the sequence of discrete control actions in an order of execution provided by one or more parameters associated with at least one of the sequence of discrete control actions; and when the execution of the sequence of discrete control actions is within an expected performance value assign the generated composite control element to a tag, the tag associated with a user interface control element; wherein: an invocation of the tag is configured to execute the sequence of discrete control actions in accordance with the determined order of execution; the robotic apparatus comprises a controller configured to generate a control signal, individual ones of the sequence of discrete control actions being configured based on the control signal, the generation of the control signal being effectuated by a learning process; the learning process comprises execution of multiple training trials, individual ones of the multiple training trials being characterized by a trial duration; individual ones of the sequence of discrete control actions correspond to an execution of a given training trial of the multiple training trials; and the two or more activations of the robotic apparatus comprise activations of at least one actuator at two or more instances of time, the two or more instances of time being separated by a time period, the time period corresponding to the trial duration.
These and other objects, features, and characteristics of the present invention, as well as the methods of operation and functions of the related elements of structure and the combination of parts and economies of manufacture, will become more apparent upon consideration of the following description and the appended claims with reference to the accompanying drawings, all of which form a part of this specification, wherein like reference numerals designate corresponding parts in the various figures. It is to be expressly understood, however, that the drawings are for the purpose of illustration and description only and are not intended as a definition of the limits of the invention. As used in the specification and in the claims, the singular form of “a”, “an”, and “the” include plural referents unless the context clearly dictates otherwise.
All Figures disclosed herein are © Copyright 2013 Brain Corporation. All rights reserved.
Implementations of the present technology will now be described in detail with reference to the drawings, which are provided as illustrative examples so as to enable those skilled in the art to practice the technology. Notably, the figures and examples below are not meant to limit the scope of the present disclosure to a single implementation, but other implementations are possible by way of interchange of or combination with some or all of the described or illustrated elements. Wherever convenient, the same reference numbers will be used throughout the drawings to refer to same or like parts.
Where certain elements of these implementations can be partially or fully implemented using known components, only those portions of such known components that are necessary for an understanding of the present technology will be described, and detailed descriptions of other portions of such known components will be omitted so as not to obscure the disclosure.
In the present specification, an implementation showing a singular component should not be considered limiting; rather, the disclosure is intended to encompass other implementations including a plurality of the same component, and vice-versa, unless explicitly stated otherwise herein.
Further, the present disclosure encompasses present and future known equivalents to the components referred to herein by way of illustration.
As used herein, the term “bus” is meant generally to denote all types of interconnection or communication architecture that is used to access the synaptic and neuron memory. The “bus” may be optical, wireless, infrared, and/or another type of communication medium. The exact topology of the bus could be for example standard “bus”, hierarchical bus, network-on-chip, address-event-representation (AER) connection, and/or other type of communication topology used for accessing, e.g., different memories in pulse-based system.
As used herein, the terms “computer”, “computing device”, and “computerized device” may include one or more of personal computers (PCs) and/or minicomputers (e.g., desktop, laptop, and/or other PCs), mainframe computers, workstations, servers, personal digital assistants (PDAs), handheld computers, embedded computers, programmable logic devices, personal communicators, tablet computers, portable navigation aids, J2ME equipped devices, cellular telephones, smart phones, personal integrated communication and/or entertainment devices, and/or any other device capable of executing a set of instructions and processing an incoming data signal.
As used herein, the term “computer program” or “software” may include any sequence of human and/or machine cognizable steps which perform a function. Such program may be rendered in a programming language and/or environment including one or more of C/C++, C#, Fortran, COBOL, MATLAB™, PASCAL, Python, assembly language, markup languages (e.g., HTML, SGML, XML, VoXML), object-oriented environments (e.g., Common Object Request Broker Architecture (CORBA)), Java™ (e.g., J2ME, Java Beans), Binary Runtime Environment (e.g., BREW), and/or other programming languages and/or environments.
As used herein, the terms “connection”, “link”, “transmission channel”, “delay line”, “wireless” may include a causal link between any two or more entities (whether physical or logical/virtual), which may enable information exchange between the entities.
As used herein, the term “memory” may include an integrated circuit and/or other storage device adapted for storing digital data. By way of non-limiting example, memory may include one or more of ROM, PROM, EEPROM, DRAM, Mobile DRAM, SDRAM, DDR/2 SDRAM, EDO/FPMS, RLDRAM, SRAM, “flash” memory (e.g., NAND/NOR), memristor memory, PSRAM, and/or other types of memory.
As used herein, the terms “integrated circuit”, “chip”, and “IC” are meant to refer to an electronic circuit manufactured by the patterned diffusion of trace elements into the surface of a thin substrate of semiconductor material. By way of non-limiting example, integrated circuits may include field programmable gate arrays (e.g., FPGAs), a programmable logic device (PLD), reconfigurable computer fabrics (RCFs), application-specific integrated circuits (ASICs), and/or other types of integrated circuits.
As used herein, the terms “microprocessor” and “digital processor” are meant generally to include digital processing devices. By way of non-limiting example, digital processing devices may include one or more of digital signal processors (DSPs), reduced instruction set computers (RISC), general-purpose (CISC) processors, microprocessors, gate arrays (e.g., field programmable gate arrays (FPGAs)), PLDs, reconfigurable computer fabrics (RCFs), array processors, secure microprocessors, application-specific integrated circuits (ASICs), and/or other digital processing devices. Such digital processors may be contained on a single unitary IC die, or distributed across multiple components.
As used herein, the term “network interface” refers to any signal, data, and/or software interface with a component, network, and/or process. By way of non-limiting example, a network interface may include one or more of FireWire (e.g., FW400, FW800, etc.), USB (e.g., USB2), Ethernet (e.g., 10/100, 10/100/1000 (Gigabit Ethernet), 10-Gig-E, etc.), MoCA, Coaxsys (e.g., TVnet™), radio frequency tuner (e.g., in-band or OOB, cable modem, etc.), Wi-Fi (802.11), WiMAX (802.16), PAN (e.g., 802.15), cellular (e.g., 3G, LTE/LTE-A/TD-LTE, GSM, etc.), IrDA families, and/or other network interfaces.
As used herein, the terms “node”, “neuron”, and “neuronal node” are meant to refer, without limitation, to a network unit (e.g., a spiking neuron and a set of synapses configured to provide input signals to the neuron) having parameters that are subject to adaptation in accordance with a model.
As used herein, the terms “state” and “node state” is meant generally to denote a full (or partial) set of dynamic variables (e.g., a membrane potential, firing threshold and/or other) used to describe state of a network node.
As used herein, the term “synaptic channel”, “connection”, “link”, “transmission channel”, “delay line”, and “communications channel” include a link between any two or more entities (whether physical (wired or wireless), or logical/virtual) which enables information exchange between the entities, and may be characterized by a one or more variables affecting the information exchange.
As used herein, the term “Wi-Fi” includes one or more of IEEE-Std. 802.11, variants of IEEE-Std. 802.11, standards related to IEEE-Std. 802.11 (e.g., 802.11 a/b/g/n/s/v), and/or other wireless standards.
As used herein, the term “wireless” means any wireless signal, data, communication, and/or other wireless interface. By way of non-limiting example, a wireless interface may include one or more of Wi-Fi, Bluetooth, 3G (3GPP/3GPP2), HSDPA/HSUPA, TDMA, CDMA (e.g., IS-95A, WCDMA, etc.), FHSS, DSSS, GSM, PAN/802.15, WiMAX (802.16), 802.20, narrowband/FDMA, OFDM, PCS/DCS, LTE/LTE-A/TD-LTE, analog cellular, CDPD, satellite systems, millimeter wave or microwave systems, acoustic, infrared (i.e., IrDA), and/or other wireless interfaces.
The controller 102 may be operable in accordance with a learning process (e.g., reinforcement learning and/or supervised learning). In one or more implementations, the controller 102 may optimize performance (e.g., performance of the system 100 of
Learning process of adaptive controller (e.g., 102 of
Individual spiking neurons may be characterized by internal state q. The internal state q may, for example, comprise a membrane voltage of the neuron, conductance of the membrane, and/or other parameters. The neuron process may be characterized by one or more learning parameter which may comprise input connection efficacy, output connection efficacy, training input connection efficacy, response generating (firing) threshold, resting potential of the neuron, and/or other parameters. In one or more implementations, some learning parameters may comprise probabilities of signal transmission between the units (e.g., neurons) of the network.
In some implementations, the training input (e.g., 104 in
During operation (e.g., subsequent to learning): data (e.g., spike events) arriving to neurons of the network may cause changes in the neuron state (e.g., increase neuron membrane potential and/or other parameters). Changes in the neuron state may cause the neuron to generate a response (e.g., output a spike). Teaching data may be absent during operation, while input data are required for the neuron to generate output.
In one or more implementations, such as object recognition, and/or obstacle avoidance, the input 106 may comprise a stream of pixel values associated with one or more digital images. In one or more implementations of e.g., video, radar, sonography, x-ray, magnetic resonance imaging, and/or other types of sensing, the input may comprise electromagnetic waves (e.g., visible light, IR, UV, and/or other types of electromagnetic waves) entering an imaging sensor array. In some implementations, the imaging sensor array may comprise one or more of RGCs, a charge coupled device (CCD), an active-pixel sensor (APS), and/or other sensors. The input signal may comprise a sequence of images and/or image frames. The sequence of images and/or image frame may be received from a CCD camera via a receiver apparatus and/or downloaded from a file. The image may comprise a two-dimensional matrix of RGB values refreshed at a 25 Hz frame rate. It will be appreciated by those skilled in the art that the above image parameters are merely exemplary, and many other image representations (e.g., bitmap, CMYK, HSV, HSL, grayscale, and/or other representations) and/or frame rates are equally useful with the present invention. Pixels and/or groups of pixels associated with objects and/or features in the input frames may be encoded using, for example, latency encoding described in U.S. patent application Ser. No. 12/869,583, filed Aug. 26, 2010 and entitled “INVARIANT PULSE LATENCY CODING SYSTEMS AND METHODS”; U.S. Pat. No. 8,315,305, issued Nov. 20, 2012, entitled “SYSTEMS AND METHODS FOR INVARIANT PULSE LATENCY CODING”; U.S. patent application Ser. No. 13/152,084, filed Jun. 2, 2011, entitled “APPARATUS AND METHODS FOR PULSE-CODE INVARIANT OBJECT RECOGNITION”; and/or latency encoding comprising a temporal winner take all mechanism described U.S. patent application Ser. No. 13/757,607, filed Feb. 1, 2013 and entitled “TEMPORAL WINNER TAKES ALL SPIKING NEURON NETWORK SENSORY PROCESSING APPARATUS AND METHODS”, each of the foregoing being incorporated herein by reference in its entirety.
In one or more implementations, object recognition and/or classification may be implemented using spiking neuron classifier comprising conditionally independent subsets as described in co-owned U.S. patent application Ser. No. 13/756,372 filed Jan. 31, 2013, and entitled “SPIKING NEURON CLASSIFIER APPARATUS AND METHODS USING CONDITIONALLY INDEPENDENT SUBSETS” and/or co-owned U.S. patent application Ser. No. 13/756,382 filed Jan. 31, 2013, and entitled “REDUCED LATENCY SPIKING NEURON CLASSIFIER APPARATUS AND METHODS”, each of the foregoing being incorporated herein by reference in its entirety.
In one or more implementations, encoding may comprise adaptive adjustment of neuron parameters, such neuron excitability described in U.S. patent application Ser. No. 13/623,820 entitled “APPARATUS AND METHODS FOR ENCODING OF SENSORY DATA USING ARTIFICIAL SPIKING NEURONS”, filed Sep. 20, 2012, the foregoing being incorporated herein by reference in its entirety.
In some implementations, analog inputs may be converted into spikes using, for example, kernel expansion techniques described in co pending U.S. patent application Ser. No. 13/623,842 filed Sep. 20, 2012, and entitled “SPIKING NEURON NETWORK ADAPTIVE CONTROL APPARATUS AND METHODS”, the foregoing being incorporated herein by reference in its entirety. In one or more implementations, analog and/or spiking inputs may be processed by mixed signal spiking neurons, such as U.S. patent application Ser. No. 13/313,826 entitled “APPARATUS AND METHODS FOR IMPLEMENTING LEARNING FOR ANALOG AND SPIKING SIGNALS IN ARTIFICIAL NEURAL NETWORKS”, filed Dec. 7, 2011, and/or co-pending U.S. patent application Ser. No. 13/761,090 entitled “APPARATUS AND METHODS FOR GATING ANALOG AND SPIKING SIGNALS IN ARTIFICIAL NEURAL NETWORKS”, filed Feb. 6, 2013, each of the foregoing being incorporated herein by reference in its entirety.
The rules may be configured to implement synaptic plasticity in the network. In some implementations, the plastic rules may comprise one or more spike-timing dependent plasticity, such as rule comprising feedback described in co-owned and co-pending U.S. patent application Ser. No. 13/465,903 entitled “SENSORY INPUT PROCESSING APPARATUS IN A SPIKING NEURAL NETWORK”, filed May 7, 2012; rules configured to modify of feed forward plasticity due to activity of neighboring neurons, described in co-owned U.S. patent application Ser. No. 13/488,106, entitled “SPIKING NEURON NETWORK APPARATUS AND METHODS”, filed Jun. 4, 2012; conditional plasticity rules described in U.S. patent application Ser. No. 13/541,531, entitled “CONDITIONAL PLASTICITY SPIKING NEURON NETWORK APPARATUS AND METHODS”, filed Jul. 3, 2012; plasticity configured to stabilize neuron response rate as described in U.S. patent application Ser. No. 13/691,554, entitled “RATE STABILIZATION THROUGH PLASTICITY IN SPIKING NEURON NETWORK”, filed Nov. 30, 2012; activity-based plasticity rules described in co-owned U.S. patent application Ser. No. 13/660,967, entitled “APPARATUS AND METHODS FOR ACTIVITY-BASED PLASTICITY IN A SPIKING NEURON NETWORK”, filed Oct. 25, 2012, U.S. patent application Ser. No. 13/660,945, entitled “MODULATED PLASTICITY APPARATUS AND METHODS FOR SPIKING NEURON NETWORKS”, filed Oct. 25, 2012; and U.S. patent application Ser. No. 13/774,934, entitled “APPARATUS AND METHODS FOR RATE-MODULATED PLASTICITY IN A SPIKING NEURON NETWORK”, filed Feb. 22, 2013; multi-modal rules described in U.S. patent application Ser. No. 13/763,005, entitled “SPIKING NETWORK APPARATUS AND METHOD WITH BIMODAL SPIKE-TIMING DEPENDENT PLASTICITY”, filed Feb. 8, 2013, each of the foregoing being incorporated herein by reference in its entirety.
In one or more implementations, neuron operation may be configured based on one or more inhibitory connections providing input configured to delay and/or depress response generation by the neuron, as described in U.S. patent application Ser. No. 13/660,923, entitled “ADAPTIVE PLASTICITY APPARATUS AND METHODS FOR SPIKING NEURON NETWORK”, filed Oct. 25, 2012, the foregoing being incorporated herein by reference in its entirety
Connection efficacy updated may be effectuated using a variety of applicable methodologies such as, for example, event based updates described in detail in co-owned U.S. patent application Ser. No. 13/239,255, filed Sep. 21, 2011, entitled “APPARATUS AND METHODS FOR SYNAPTIC UPDATE IN A PULSE-CODED NETWORK”; U.S. patent application Ser. No. 13/588,774, entitled “APPARATUS AND METHODS FOR IMPLEMENTING EVENT-BASED UPDATES IN SPIKING NEURON NETWORKS”, filed Aug. 17, 2012; and U.S. patent application Ser. No. 13/560,891 entitled “APPARATUS AND METHODS FOR EFFICIENT UPDATES IN SPIKING NEURON NETWORK”, each of the foregoing being incorporated herein by reference in its entirety.
Neuron process may comprise one or more learning rules configured to adjust neuron state and/or generate neuron output in accordance with neuron inputs.
In some implementations, the one or more learning rules may comprise state dependent learning rules described, for example, in U.S. patent application Ser. No. 13/560,902, entitled “APPARATUS AND METHODS FOR GENERALIZED STATE-DEPENDENT LEARNING IN SPIKING NEURON NETWORKS”, filed Jul. 27, 2012 and/or pending U.S. patent application Ser. No. 13/722,769 filed Dec. 20, 2012, and entitled “APPARATUS AND METHODS FOR STATE-DEPENDENT LEARNING IN SPIKING NEURON NETWORKS”, each of the foregoing being incorporated herein by reference in its entirety.
In one or more implementations, the one or more learning rules may be configured to comprise one or more reinforcement learning, unsupervised learning, and/or supervised learning as described in co-owned and co-pending U.S. patent application Ser. No. 13/487,499 entitled “STOCHASTIC APPARATUS AND METHODS FOR IMPLEMENTING GENERALIZED LEARNING RULES, incorporated herein by reference in its entirety.
In one or more implementations, the one or more leaning rules may be configured in accordance with focused exploration rules such as described, for example, in U.S. patent application Ser. No. 13/489,280 entitled “APPARATUS AND METHODS FOR REINFORCEMENT LEARNING IN ARTIFICIAL NEURAL NETWORKS”, filed Jun. 5, 2012, the foregoing being incorporated herein by reference in its entirety.
Adaptive controller (e.g., the controller apparatus 102 of
The control entity 212 may be configured to generate control signal 208 based on one or more of (i) sensory input (denoted 206 in
The adaptive predictor 222 may be configured to generate predicted control signal uP 218 based on one or more of (i) the sensory input 206 and the plant feedback 216_1. The predictor 222 may be configured to adapt its internal parameters, e.g., according to a supervised learning rule, and/or other machine learning rules.
Predictor realizations, comprising plant feedback, may be employed in applications such as, for example, wherein (i) the control action may comprise a sequence of purposefully timed commands (e.g., associated with approaching a stationary target (e.g., a cup) by a robotic manipulator arm); and (ii) the plant may be characterized by a plant state time parameter (e.g., arm inertia, and/or motor response time) that may be greater than the rate of action updates. Parameters of a subsequent command within the sequence may depend on the plant state (e.g., the exact location and/or position of the arm joints) that may become available to the predictor via the plant feedback.
The sensory input and/or the plant feedback may collectively be referred to as sensory context. The context may be utilized by the predictor 222 in order to produce the predicted output 218. By way of a non-limiting illustration of obstacle avoidance by an autonomous rover, an image of an obstacle (e.g., wall representation in the sensory input 206) may be combined with rover motion (e.g., speed and/or direction) to generate Context_A. When the Context_A is encountered, the control output 220 may comprise one or more commands configured to avoid a collision between the rover and the obstacle. Based on one or more prior encounters of the Context_A—avoidance control output, the predictor may build an association between these events as described in detail below.
The combiner 214 may implement a transfer function h( ) configured to combine the control signal 208 and the predicted control signal 218. In some implementations, the combiner 214 operation may be expressed as described in detail in U.S. patent application Ser. No. 13/842,530 entitled “ADAPTIVE PREDICTOR APPARATUS AND METHODS”, filed Mar. 15, 2013, as follows:
û=h(u,uP). (Eqn. 1)
Various realizations of the transfer function of Eqn. 1 may be utilized. In some implementations, the transfer function may comprise an addition operation, a union, a logical ‘AND’ operation, and/or other operations.
In one or more implementations, the transfer function may comprise a convolution operation. In spiking network realizations of the combiner function, the convolution operation may be supplemented by use of a finite support kernel such as Gaussian, rectangular, exponential, and/or other finite support kernel. Such a kernel may implement a low pass filtering operation of input spike train(s). In some implementations, the transfer function may be characterized by a commutative property configured such that:
û=h(u,uP)=h(uP,u). (Eqn. 2)
In one or more implementations, the transfer function of the combiner 214 may be configured as follows:
h(0,uP)=uP. (Eqn. 3)
In one or more implementations, the transfer function h may be configured as:
h(u,0)=u. (Eqn. 4)
In some implementations, the transfer function h may be configured as a combination of realizations of Eqn. 3-Eqn. 4 as:
h(0,uP)=uP, and h(u,0)=u, (Eqn. 5)
In one exemplary implementation, the transfer function satisfying Eqn. 5 may be expressed as:
h(u,uP)=(1−u)×(1−uP)−1. (Eqn. 6)
In one such realization, the combiner transfer function configured according to Eqn. 3-Eqn. 6, thereby implementing an additive feedback. In other words, output of the predictor (e.g., 218) may be additively combined with the control signal (208) and the combined signal 220 may be used as the teaching input (204) for the predictor. In some implementations, the combined signal 220 may be utilized as an input (context) signal 228 into the predictor 222.
In some implementations, the combiner transfer function may be characterized by a delay expressed as:
{circumflex over (u)}(ti+1)=h(u(ti),uP(ti)). (Eqn. 7)
In Eqn. 7, û(ti+1) denotes combined output (e.g., 220 in
It will be appreciated by those skilled in the arts that various other realizations of the transfer function of the combiner 214 (e.g., comprising a Heaviside step function, a sigmoidal function, such as the hyperbolic tangent, Gauss error function, or logistic function, and/or a stochastic operation) may be applicable.
Operation of the predictor 222 learning process may be aided by a teaching signal 204. As shown in
ud=û. (Eqn. 8)
In some implementations wherein the combiner transfer function may be characterized by a delay τ (e.g., Eqn. 7), the teaching signal at time ti may be configured based on values of u, uP at a prior time ti−1, for example as:
ud(ti)=h(u(ti−1),uP(ti−1)). (Eqn. 9)
The training signal ud at time ti may be utilized by the predictor in order to determine the predicted output uP at a subsequent time ti+1, corresponding to the context (e.g., the sensory input x) at time ti;
uP(ti+1)=F[xi,W(ud(ti))]. (Eqn. 10)
In Eqn. 10, the function W may refer to a learning process implemented by the predictor.
In one or more implementations, such as illustrated in
Output 220 of the combiner e.g., 214 in
In some implementations of spiking signal output, the combiner 214 may comprise a spiking neuron network; and the control signal 208 may be communicated via two or more connections. One such connection may be configured to communicate spikes indicative of a control command to the combiner neuron; the other connection may be used to communicate an inhibitory signal to the combiner network. The inhibitory signal may inhibit one or more neurons of the combiner the one or more combiner input neurons of the combiner network thereby effectively removing the predicted control signal from the combined output (e.g., 220 in
The gating information may be provided to the combiner via a connection 224 from another entity (e.g., a human operator controlling the system with a remote control, and/or external controller) and/or from another output from the controller 212 (e.g. an adapting block, or an optimal controller). In one or more implementations, the gating information delivered via the connection 224 may comprise one or more of: a command, a memory address of a register storing a flag, a message, an inhibitory efficacy, a value (e.g., a weight of zero to be applied to the predicted control signal 218 by the combiner), and/or other information capable of conveying gating instructions to the combiner.
The gating information may be used by the combiner network to inhibit and/or suppress the transfer function operation. The suppression (or ‘veto’) may cause the combiner output (e.g., 220) to be comprised solely of the control signal portion 218, e.g., configured in accordance with Eqn. 4.
In one or more implementations, the gating signal 224 may comprise an inhibitory indication that may be configured to inhibit the output from the combiner. Zero combiner output may, in some realizations, may cause zero teaching signal (e.g., 214 in
The gating signal 224 may be used to veto predictor output 218 based on, for example, the predicted control output 218 being away from the target output by more than a given margin. The margin may be configured based on an application and/or state of the trajectory. For example, a smaller margin may be applicable in navigation applications wherein the platform is proximate to a hazard (e.g., a cliff) and/or an obstacle. A larger error may be tolerated when approaching one (of many) targets.
By way of a non-limiting illustration, if the turn is to be completed and/or aborted (due to, for example, a trajectory change and/or sensory input change), and the predictor output may still be producing turn instruction to the plant, the gating signal may cause the combiner to veto (ignore) the predictor contribution and to pass through the controller contribution.
Predicted control signal 218 and the control input 208 may be of opposite signs. In one or more implementations, positive predicted control signal (e.g., 218) may exceed the target output that may be appropriate for performance of as task (e.g., as illustrated by data of trials 8-9 in Table 3). Control signal 208 may be configured to comprise negative signal (e.g., −10) in order to compensate for overprediction by the predictor.
Gating and/or sign reversal of controller output may be useful, for example, responsive to the predictor output being incompatible with the sensory input (e.g., navigating towards a wrong target). Rapid (compared to the predictor learning time scale) changes in the environment (e.g., appearance of a new obstacle, target disappearance), may require a capability by the controller (and/or supervisor) to ‘overwrite’ predictor output. In one or more implementations compensation for overprediction may be controlled by a graded form of the gating signal delivered via the connection 224.
In some implementations, the predictor 232 may comprise a single multichannel predictor capable of generating N-dimensional (N>1) predicted signal 248 based on a multi-channel training input 234 and sensory input 36. In one or more implementations, the predictor 232 may comprise multiple individual predictor modules (232_1, 232_2) configured to generate individual components of the multi-channel output (248_1, 248_2). In some implementations, individual teaching signal may be de-multiplexed into multiple teaching components (234_1, 234_2). Predictor 232 learning process may be configured to adapt predictor state based on teaching signal 234.
The predicted signal UP may comprise a vector corresponding to a plurality of output channels (e.g., 238_1, 238_2 in
The combiner 242 may be operable in accordance with a transfer function h configured to combine signals 238, 248 and to produce single-dimensional control signal 240:
û=h(U,UP). (Eqn. 11)
In one or more implementations, the combined control signal 240 may be provided to the predictor as the training signal. The training signal may be utilized by the predictor learning process in order to generate the predicted output 248 (e.g., as described with respect to
In some implementations, a complex teaching signal may be decomposed into multiple components that may drive adaptation of multiple predictor blocks (associated with individual output channels. Prediction of a (given) teaching signal 234 may be spread over multiple predictor output channels 248. Once adapted, outputs of multiple predictor blocks 232 may be combined thereby providing prediction of the teaching signal (e.g., 234 in
In spiking neuron networks implementations, inputs (e.g., 238, 248 of
The use of multiple input signals (238_1, 238_2 in
Combiner 242 operation, comprising input decoding-output encoding methodology, may be based on an implicit output determination. In some implementations, the implicit output determination may comprise, determining one or more input values using latency and/or rate input conversion into e.g., floating point and/or integer; updating neuron dynamic process based on the one or more input values; and encoding neuron output into rate or latency. In one or more implementations, the neuron process may comprise a deterministic realization (e.g., Izhikevich neuron model, described for example in co-owned U.S. patent application Ser. No. 13/623,842, entitled “SPIKING NEURON NETWORK ADAPTIVE CONTROL APPARATUS AND METHODS”, filed Sep. 3, 2012, incorporated supra; and/or a stochastic process such as described, for example, in U.S. patent application Ser. No. 13/487,533, entitled “SYSTEMS AND APPARATUSES FOR IMPLEMENTING TASK-SPECIFIC LEARNING USING SPIKING NEURONS”, incorporated supra.
In some implementations, combiner operation, comprising input decoding-output encoding methodology, may be based on an explicit output determination, such as, for example, expressed by Eqn. 4-Eqn. 9, Eqn. 14.
In one or more implementations, a predictor may be configured to predict multiple teaching signals, as illustrated in
The adaptive controller system 270 may comprise a multiplexing predictor 272 and two or more combiner apparatus 279. Controller input U may be de-multiplexed into two (e.g., input 278_1 into combiners 279_1, 279_2) and/or more (input 278_2 into combiners 279_1, 279_2, 279_3). Individual combiner apparatus 279 may be configured to multiplex one (or more) controller inputs 278 and two or more predictor outputs UP 288 to form a combined signal 280. In some implementations, the predictor output for a given combiner may be spread (de-multiplexed) over multiple prediction channels (e.g., 288_1, 288_2 for combiner 279_2). In one or more implementations, teaching input to a predictor may be delivered via multiple teaching signal 274 associated with two or more combiners.
The predictor 272 may operate in accordance with a learning process configured to determine an input-output transformation such that the output of the predictor UP after learning is configured to match the output of the combiner h(U, UP) prior to learning (e.g., when UP comprises a null signal).
Predictor transformation F may be expressed as follows:
UP=F({circumflex over (U)}),Û=h(UP). (Eqn. 12)
In some implementations, wherein dimensionality of control signal U matches dimensionality of predictor output UP, the transformation of Eqn. 12 may be expressed in matrix form as:
UP=FÛ,Û=HUP,F=inv(H), (Eqn. 13)
where H may denote the combiner transfer matrix composed of transfer vectors for individual combiners 279 H=[h1, h2, . . . , hn], Û=[û1, û2, . . . ûn] may denote output matrix composed of output vectors 280 of individual combiners; and F may denote the predictor transform matrix. The combiner output 280 may be provided to the predictor 272 and/or another predictor apparatus as teaching signal 274 in
In some implementations of multi-channel predictor (e.g., 232, 272) and/or combiner (e.g., 242, 279) various signal mapping relationships may be utilized such as, for example, one to many, many to one, some to some, many to some, and/or other relationships (e.g., one to one).
In some implementations, prediction of an individual teaching signal (e.g., 234 in
Transfer function h (and or transfer matrix H) of the combiner (e.g., 242, 279 in
In implementations where the combiner is configured to perform the state-space transform (e.g., time-space to frequency space), the predictor may be configured to learn an inverse of that transform (e.g., frequency-space to time-space). Such predictor may be capable of learning to transform, for example, frequency-space input û into time-space output uP.
In some implementations, predictor learning process may be configured based on one or more look-up tables (LUT). Table 1 and Table 2 illustrate use of look up tables for learning obstacle avoidance behavior (e.g., as described with respect to Table 3-Table 5 and/or
Table 1-Table 2 present exemplary LUT realizations characterizing the relationship between sensory input (e.g., distance to obstacle d) and control signal (e.g., turn angle cc relative to current course) obtained by the predictor during training. Columns labeled N in Table 1-Table 2, present use occurrence N (i.e., how many times a given control action has been selected for a given input, e.g., distance). Responsive to a selection of a given control action (e.g., turn of 15°) based on the sensory input (e.g., distance from an obstacle of 0.7 m), the counter N for that action may be incremented. In some implementations of learning comprising opposing control actions (e.g., right and left turns shown by rows 3-4 in Table 2), responsive to a selection of one action (e.g., turn of)+15° during learning, the counter N for that action may be incremented while the counter for the opposing action may be decremented.
As seen from the example shown in Table 1, as a function of the distance to obstacle falling to a given level (e.g., 0.7 m), the controller may produce a turn command. A 15° turn is most frequently selected during training for distance to obstacle of 0.7 m. In some implementations, predictor may be configured to store the LUT (e.g., Table 1) data for use during subsequent operation. During operation, the most frequently used response (e.g., turn of) 15° may be output for a given sensory input, in one or more implementations, In some implementations, the predictor may output an average of stored responses (e.g., an average of rows 3-5 in Table 1).
In some implementations of a control system, such as described with respect to
Action indications (e.g., 308, 348 in
Returning now to
The predictor 302 may be configured to generate the predicted action indication AP 318 based on the sensory context 306 and/or training signal 304. In some implementations, the training signal 304 may comprise the combined output A.
In one or more implementations, generation of the predicted action indication 318 may be based on the combined signal A being provided as a part of the sensory input (316) to the predictor. In some implementations comprising the feedback loop 318, 312, 316 in
In some implementations, generation of the predicted action indication AP by the predictor 302 may be effectuated using any of the applicable methodologies described above (e.g., with respect to
The predictor 302 may be further configured to generate the plant control signal 314 low level control commands/instructions based on the sensory context 306. The predicted control signal 314 may be interfaced to a plant. In some control implementations, such low-level commands may comprise instructions to rotate a right wheel motor by 30°, apply motor current of 100 mA, set motor torque to 10%, reduce lens diaphragm setting by 2, and/or other commands. The low-level commands may be configured in accordance with a specific implementation of the plant, e.g., number of wheels, motor current draw settings, diaphragm setting range, gear ration range, and/or other parameters.
In some implementations of target approach, such as illustrated in
Responsive to the ‘turn’ command arriving to the predictor proximate in time to the sensory context indicative of a target, the predictor may generate right/left turn control signal in the presence of the sensory context. Time proximity may be configured based on a particular application parameters (e.g., robot speed, terrain, object/obstacle size, location distance, and/or other parameters). In some applications to garbage collecting robot, the turn command may be time locked (to within +10 ms) from the sensory context indicative of a need to turn (for example toward a target). In some realizations, a target appearing to the right of the robot in absence of obstacles may trigger the action ‘turn right’.
During learning predictor may associate movement towards the target (behavior) with the action indication. Subsequently during operation, the predictor may execute the behavior (e.g., turn toward the target) based on a receipt of the action indication (e.g., the ‘turn’ instruction). In one or more implementations, the predictor may be configured to not generate control signal (e.g., 314 in
Such associations between the sensory input and the action indicator may form a plurality of composite motor primitive comprising an action indication (e.g., A=turn) and actual control instructions to the plant that may be configured in accordance with the plant state and sensory input.
In some implementations, the predictor may be configured to learn the action indication (e.g., the signal 308 in
Based on learning of associations between action tag-control command; and/or learning to generate action tags, the predictor may be able to learn higher-order control composites, such as, for example, ‘approach’, ‘fetch’, ‘avoid’, and/or other actions, that may be associated with the sensory input.
The control system 320 may comprise controller 342, predictor 322, plant 340, and one or more combiners 330, 350. The controller 342 may be configured to generate action indication A 348 based on sensory input 326 and/or plant feedback 336. The controller 342 may be further configured to generate one or more low-level plant control commands (e.g., 346) based on sensory input 326 and/or plant feedback 336. In some control implementations, the low-level commands 346 may comprise instructions to rotate a right wheel motor by 30°, apply motor current of 100 mA, set motor torque to 10%, reduce lens diaphragm setting by 2, and/or other commands. The low-level commands may be configured in accordance with a specific implementation of the plant, e.g., number of wheels, motor current draw settings, diaphragm setting range, gear ration range, and/or other parameters.
One or more of the combiners of the control system of
One or more of the combiners (e.g., 350) may be configured to combine a control command 346, provided by the controller, and the predicted control instructions uP 344, provided by the predictor, to produce plant control instructions û=h(u,uP) (e.g., 352).
The predictor 322 may be configured to perform prediction of (i) one or more action indications 348; and/or plant control signal uP 352 that may be associated with the sensory input 326 and/or plant feedback 336. The predictor 322 operation may be configured based on two or more training signals 324, 354 that may be associated with the action indication prediction and control command prediction, respectively. In one or more implementations, the training signals 324, 354 at time t2 may comprise outputs of the respective combiners 330, 350 at a prior time (e.g., t1=t2−dt), as described above with respect to Eqn. 7.
The predictor 322 may be operable in accordance with a learning process configured to enable the predictor to develop associations between the action indication input (e.g., 348_1) and the lower-level control signal (e.g., 352). In some implementations, during learning, this association development may be aided by plant control instructions (e.g., 346) that may be issued by the controller 342. One (or both) of the combined action indication signal (e.g., 332_1) and/or the combined control signal (e.g., 352) may be utilized as a training input (denoted in
In some implementations, the combined action indication signal (e.g., 332) and/or the combined control signal (e.g., 352) may be provided to the predictor as a portion of the sensory input, denoted by the arrows 356 in
In one or more implementations, two or more action indications (e.g., 348_1, 348_2— may be associated with the control signal 352. By way of a non-limiting example, illustrated for example in
Upon learning these composite tasks, the predictor 322 may be provided with a higher level action indication (e.g., 348_3). The term ‘higher level’ may be used to describe an action (e.g., ‘approach’/‘avoid’) that may comprise one or more lower level actions (e.g., 348_1, 348_2, ‘turn right’/‘turn left’). In some implementations, the higher level action indication (e.g., 348_3) may be combined (by, e.g., the combiner 330_3 in
Control action separation between the predictor 302, 322 (configured to produce the plant control signal 314, 352) and the controller 342 (configured to provide the action indication 348) described above, may enable the controller (e.g., 342 in
Control action separation between the predictor 302, 322 (configured to produce the plant control signal 314, 352) and the controller 342 (configured to provide the action indication 348) described above, may enable the controller (e.g., 342 in
The controller 342 may be operable in accordance with a reinforcement learning (RL) process. In some implementations, the RL process may comprise a focused exploration methodology, described for example, in co-owned U.S. patent application Ser. No. 13/489,280 entitled “APPARATUS AND METHODS FOR REINFORCEMENT LEARNING IN ARTIFICIAL NEURAL NETWORKS”, filed Jun. 5, 2012, incorporated supra.
The predictor 322 may be operable in accordance with a supervised learning (SL) process. In some implementations, the supervised learning process may be configured to cause output that is consistent with the teaching signal. Output consistency may be determined based on one or more similarity measures, such as correlation, in one or more implementations.
Reinforcement learning process of the controller may rely on one or more exploration techniques. In some implementations, such exploration may cause control signal corresponding one or more local minima of the controller dynamic state. Accordingly, small changes in the controller input (e.g., sensory input 326 in
Exemplary operation of adaptive controller system (e.g., 200, 230, 270 of
The control signal (e.g., 208 in
The transfer function of the combiner of the exemplary implementation of the adaptive controller apparatus 200, may be configured as follows:
û=h(u,uP)=u+uP. (Eqn. 14)
Training of the adaptive predictor (e.g., 222 of
In some implementations the trial duration may last longer (up to tens of second) and be determined based on a difference measure between current performance of the plant (e.g., current distance to an object) and a target performance (e.g., a target distance to the object). The performance may be characterized by a performance function as described in detail in co-owned and co-pending U.S. patent application Ser. No. 13/487,499 entitled “STOCHASTIC APPARATUS AND METHODS FOR IMPLEMENTING GENERALIZED LEARNING RULES, incorporated supra. Individual trials may be separated in time (and in space) by practically any duration commensurate with operational cycle of the plant. By way of illustration, individual trial when training a robot to approach objects and/or avoid obstacles may be separated by a time period and/or space that may be commensurate with the robot traversing from one object/obstacle to the next. In one or more implementations, the robot may comprise a rover platform, and/or a robotic manipulator arm comprising one or more joints. e.g., as shown and described with respect to
The platform may be adapted to accept a telescopic arm 410 disposed thereupon. The arm 410 may comprise one or more portions (e.g., boom 412, portion 414) configured to be moved in directions shown by arrows 406 (telescope boom 412 in/out), 422 (rotate the portion 414 up/down), and/or other directions. A utility attachment 415 may be coupled to the arm 414. In one or more implementations, the attachment 415 may comprise a hook, a grasping device, a ball, and/or any applicable attachment. The attachment 415 may be moved in direction shown by arrow 426. The arm 410 may be configured to elevate up/down (using for example, motor assembly 411) and/or be rotated as shown by arrows 420, 428 respectively in
The control elements 464, 462 may be configured to operate along directions 462, 460, respectively. The control elements 464, 462 may be configured to control two dimensional motion of the platform 402 (shown by arrows 424, 429, respectively in
In some implementations of the robotic device (e.g., the robotic apparatus 400), the portion 414 may be omitted during device configuration, and/or configured to extend and/or retract (e.g., by a telescoping action). The controller 450 interface may be configured in accordance with modification of the robotic device, by for example, providing an additional control element (not shown) to control the extension of the portion 414. In some implementations, in order to reduce the number of controls, additional control operations may be effectuated by contemporaneous motion of two or more control elements. By way of example, simultaneous motion of control elements 454, 456 may effectuate extension control of the portion 414.
The controller 457 of
During another trial at time T2>T1:
During another trial at time T3>T2:
During other trials at times Ti>T3 the predictor output may be increased to the target plant turn of 45° and the control signal 208 may be reduced to zero. In some implementations, the outcome of the above operational sequence may be referred to as (gradual) transfer of the control signal to the predictor output. A summary of one implementation of the training process described above may be summarized using data shown in Table 1:
As seen from Table 3, when the predictor is capable to producing the target output (e.g., trial #10), the control signal (e.g., 208 in
In some implementations, the control entity (e.g., 212 in
In one or more implementations, the training steps outlined above (e.g., trials summarized in Table 3) may occur over two or more trials wherein individual trial extend over behavioral time scales (e.g., one second to tens of seconds).
In some implementations, the training steps may occur over two or more trials wherein individual trials may be characterized by control update scales (e.g., 1 ms to 1000 ms).
In some implementations, the operation of an adaptive predictor (e.g., 222 in
In one or more implementations, the teacher may employ a demonstration with so-called kinesthetic teaching, wherein the robot is physically guided (e.g., ‘dragged’) through the trajectory by the teacher. In this approach, the adaptive controller learning process may comprise an inverse model of the robotic platform. The adaptive controller may be configured to translate the changes in the observed robot sensory space to the motor actions that would result in the same sensory space.
In one or more implementations, the robot may employ learning by a mimicking methodology. The robot may be configured to observe a demonstrator performing the desired task and may learn to perform the same task on its own.
While following the target trajectory, a learning process of the robot controller may learn (e.g., via adaptation of learning parameters) an interrelationship between the sensory input, the controller state, and/or the teaching input. In the realization illustrated in
Upon completion of one or more teacher-guided trials, the robot 622 may be configured to perform one or more teacher-assisted trials (e.g., the trials 624, 626, 628 in FIG. 6B). During a teacher-assisted trial the adaptive controller of the robot 622 may be configured to generate a predicted control signal (e.g., 218 in
The teacher may utilize a reset signal configured to reset to a base state configuration of the learning process. In some implementations, such reset may be used to reset neuron states and/or connection weights of a predictor based on predictor generating predicted signal that may be inconsistent (e.g., guides the robot away from a target in target approach task) with the target action.
In some implementations, the learning process may be configured to store intermediate learning stages corresponding to one or more portions of the trajectory traversal. By way of illustration, the trajectory portions 638, 640 in
During individual trials 624, 626, 628 user assistance may be provided one or more times, as illustrated by arrows 636, 646, 648 in
While following a trajectory during trials 624, 626, 628, a learning process of the robot controller may learn (e.g., via adaptation of learning parameters) an interrelationship between the sensory input, the controller state (e.g., predicted control signal), and/or the teaching input.
During successive trials 624, 626, 628 the performance of the robot may improve as determined based on a performance measure. In some implementations, the performance measure may comprise a discrepancy measure between the actual robot trajectory (e.g., 632, 634) and the target trajectory. The discrepancy measure may comprise one or more of maximum deviation, maximum absolute deviation, average absolute deviation, mean absolute deviation, mean difference, root mean squatter error, cumulative deviation, and/or other measures.
Upon completion of one or more teacher-assisted trials (e.g., 624, 628), the robot 622 may be configured to navigate the target trajectory absent user input (not shown in
Learning by the adaptive controller apparatus (e.g., 200
It is noteworthy that, in accordance with the principles of the present disclosure, the information transfer (such as described with respect to
In one or more implementations, the adaptive controller may be configured to generate the predicted signal uP such that it closely reproduces the initial control signal u. This is shown in Table 3, where predicted signal at trial 10 matches the initial control signal at trial 1.
In one or more implementations, such as described in owned U.S. patent application Ser. No. 13/842,530 entitled “ADAPTIVE PREDICTOR APPARATUS AND METHODS”, filed Mar. 15, 2013, the adaptive controller may be configured to predict cumulative (e.g., integrated over the trial duration) outcome of the control action.
The rover 610 in
Task execution (e.g. target approach and/or obstacle avoidance) may comprise development of hierarchical control functionality, e.g., described with respect to
Higher level primitives of the hierarchy may be developed based on a user request. In some implementations, the user may utilize one or more tags indicating, e.g., an operating sequence configured to be implemented as a higher hierarchy level control. By way of illustration, a user may transmit a start tag, perform one or more control operations, (e.g., manipulate the controls 452, 454, 456 of
A hierarchy of control elements and/or primitives, e.g., as described above with respect to
The higher-level (e.g., composite) controls (e.g., 1300, 1320, 1330) may comprise audio commands, gestures, eye tracking, brain-machine interface and/or other communication methodologies. In some implementations, a user may associate an audio command tag with a specific task. For example, an audio tag such as ‘forward’ or ‘fetch’ may be associated with commanding the robot to move forward or play fetch, respectively. In some implementations, the robotic controller may comprise an audio processing block configured to store a characteristic (e.g., a spectrogram) associated with the command tag (e.g., word ‘fetch’). As a part of generating a given higher-level control primitive, the controller may accept user input comprising a tag associated with the given higher-level control primitive. The tag may comprise an audio tag (e.g., voice command, clap, and/or other audio tag), a clicker sequence, a pattern (e.g., gesture, touch, eye movement, and/or other pattern), and/or other tag. Such an approach may alleviate a need for implementing recognition functionality (e.g., voice or gesture recognition) within the robotic device thereby enabling reduction of cost and/or complexity of the robot. The voice tag approach may be utilized by a user whose native language (e.g., English) may differ from that of the robot designer or manufacturer (e.g., Japanese) so as obviating a need to follow phonetic and pronunciation particulars of the designer's language. It will be appreciated by those skilled in the art that command tags may not need to relate to the task subject. The user may select to use arbitrary commands (e.g., ‘one’, ‘two’) in order to command the robot to move forward, backward. The tag provision may be prompted by the controller (e.g., via a prompt “How would you like to term the new control?”). The tag may be associated with a visible control element disposed on the control interface (e.g., say ‘one’ for action 1, say ‘two’ for action 2, and/or other visible control element). Upon accepting a user tag, the controller may store a tag characteristic (e.g., spectrogram, a pattern template, and/or another characteristic) for future tag detection. In one or more implementations, the tag detection may be effectuated based on a template matching approach, e.g., based on a cross correlation of user input and tag template (e.g., spectrogram). In some implementations, the tag detection may be effectuated based on a classification approach, for example, as described in U.S. patent application Ser. No. 13/756,372 entitled “SPIKING NEURON CLASSIFIER APPARATUS AND METHODS USING CONDITIONALLY INDEPENDENT SUBSETS”, filed Jan. 31, 2013, the foregoing being incorporated herein by reference in its entirety.
The subtasks (e.g., 1410, 1412, 1414 in
Subtasks of a given level (e.g., 1400, 1408 and/or 1410, 1412, 1414 in
As illustrated in
The task 1408 may correspond to avoid target and may invoke right/left turn and/or backwards motion tasks 1410, 1412, 1416, respectively.
Individual tasks of the second level (e.g., 1410, 1412, 1414, 1416 in
The hierarchy illustrated in
In one or more implementations wherein the predictor comprises a spiking neuron network, learning a given behavior (e.g., obstacle avoidance and/or target approach) may be effectuated by storing an array of efficacies of connections within the predictor network. In some implementations, the efficacies may comprise connection weights, adjusted during learning using any applicable methodologies. In some implementations, connection plasticity (e.g., efficacy adjustment) may be implemented based on the teaching input as follows:
Individual network portions may be configured to implement individual adaptive predictor realizations. In some implementations, one network portion may implement object approach predictor while another network portion may implement obstacle avoidance predictor. Another network portion may implement a task predictor (e.g., fetch). In some implementations, predictors implemented by individual network portions may form a hierarchy of predictors. Lower-level predictors may be configured to produce control (e.g., motor) primitives (also referred to as the pre-action and/or pre-motor output). Higher level predictors may provide output comprising predicted obstacle avoidance/target approach instructions (e.g., approach, avoid).
In some implementations of a fetch task (comprising for example target approach and/or obstacle avoidance), the lower level predictors may predict execution of basic actions (so called, motor primitives), e.g., rotate left with v=0.5 rad/s for t=10 s.
Predictors of a higher level within the hierarchy, may be trained to specify what motor primitive to run and with what parameters (e.g., v, t).
At a higher level of hierarchy, the predictor may be configured to plan a trajectory and/or predict an optimal trajectory for the robot movement for the given context.
At yet another higher level of the hierarchy, a controller may be configured to determine a behavior that is to be executed at a given time, e.g. now to execute the target approach and/or to avoid the obstacle.
In some implementations, a hierarchy actions may be expressed as:
In one or more implementations of hierarchy of predictors, lower level predictors may provide inputs to higher level predictors. Such configuration may advantageously alleviate the higher level predictor from performing all of the functionality that may be required in order to implement target approach and/or obstacle avoidance functionality.
The hierarchical predictor configuration described herein may be utilized for teaching a robotic device to perform a new task (e.g., behavior B3 comprised of reaching a target (behavior B1) while avoiding obstacles (behavior B2). The hierarchical predictor realization may enable a teacher (e.g., a human and/or computerized operator) to divide the composite behavior B3 into two or more subtasks (B1, B2). In one or more implementations, performance of the subtasks may be characterized by lower processing requirements by the processing block associated with the respective predictor; and/or may require less time in order to arrive at a target level of performance during training, compared to an implementation wherein all of the behaviors (B1, B2, B3) are learned concurrently with one another. Predictors of lower hierarchy may be trained to perform subtasks B1, B2 in a shorter amount of time using fewer computational and/or memory resources, compared to time/resource budget that may be required for training a single predictor to perform behavior B3.
When training a higher hierarchy predictor to perform new task (e.g., B3 acquire a target), the approach described above may enable reuse of the previously learnt task/primitives (B1/B2) and configured the predictor to implement learning of additional aspects that may be associated with the new task B3, such as B3a reaching and/or B3b grasping.
If another behavior is to be added to the trained behavior list (e.g., serving a glass of water), previously learned behavior(s) (e.g., reaching, grasping, and/or others, also referred to as the primitives) may be utilized in order to accelerate learning compared to implementations of the prior art.
Reuse of previously learned behaviors/primitives may enable reduction in memory and/or processing capacity (e.g., number of cores, core clock speed, and/or other parameters), compared to implementations wherein all behaviors are learned concurrently. These advantages may be leveraged to increase processing throughput (for a given neuromorphic hardware resources) and/or perform the same processing with a reduced complexity and/or cost hardware platform.
Learning of behaviors and/or primitives may comprise determining an input/output transformation (e.g., the function F in Eqn. 10, and/or a matrix F of Eqn. 13) by the predictor. In some implementations, learning a behavior may comprise determining a look-up table and/or an array of weights of a network as described above. Reuse of previously learned behaviors/primitives may comprise restoring/copying stored LUTs and/or weights into predictor realization configured for implementing learned behavior.
By way of non-limiting illustration, the waveforms of
Individual curves 721, 722, 723, 724, 726 may depict user input during individual trials (e.g., 620, 624, 626, in
It may be appreciated by those skilled in the art that the user input signal waveforms illustrated in
The time intervals denoted by brackets 810, 812, 814 may refer to individual training trials (e.g., trials T1, T2, T3 described above with respect to Table 3). The arrow denoted 806 may refer to a trial duration being associated with, for example, a behavioral time scale.
The arrow denoted 808 may refer to inter-trial intervals and describe training time scale.
In some implementations, shown and described with respect to
Sensory input associated with the training configuration of trace 800 is depicted by rectangles on trace 830 in
Whenever the bottle may be visible in the sensory input, the robotic device may continue learning grasping behavior (B2) trials 822, 824. In some realizations, learning trials of two or more behaviors may overlap in time (e.g., 812, 822 in
Operation of the control entity 212 (e.g., 212 in
Responsive to the control entity (e.g., a user) detecting an obstacle (sensory input state x1), the control signal (e.g., 208 in
As shown in Table 4 during Trial 1, the control signal is configured at 9° throughout the training. The sensory, associated with the turning rover, is considered as changing for individual turn steps. Individual turn steps (e.g., 1 through 5 in Table 2) are characterized by different sensory input (state and/or context x1 through x5).
At presented in Table 4, during Trial 1, the predictor may be unable to adequately predict controller actions due to, at least in part, different input being associated with individual turn steps. The rover operation during Trial 1 may be referred to as the controller controlled with the controller performing 100% of the control.
The Trial 2, summarized in Table 4, may correspond to another occurrence of the object previously present in the sensory input processes at Trial 1. At step 1 of Trial 2, the control signal may comprise a command to turn 9° based on appearance of the obstacle (e.g., x1) in the sensory input. Based on prior experience (e.g., associated with sensory states x1 through x5 of Trail 1), the predictor may generate predicted output uP=3° at steps 1 through 5 of Trial 2, as shown in Table 4. In accordance with sensory input and/or plant feedback, the controller may vary control signal u at steps 2 through 5. Overall, during Trial 2, the predictor is able to contribute about 29% (e.g., 15° out of 51°) to the overall control signal u. The rover operation during Trial 2 may be referred to as jointly controlled by the control entity (e.g., a human user) and the predictor. It is noteworthy, neither the predictor nor the controller are capable of individually providing target control signal of 45° during Trial 2.
The Trial 3, summarized in Table 4, may correspond to another occurrence of the object previously present in the sensory input processes at Trials 1 and 2. At step 1 of Trial 3, the control signal may reduce control signal 3° turn based on the appearance of the obstacle (e.g., x1) in the sensory input and/or prior experience during Trial 2, wherein the combined output u1′ was in excess of the target 9°. Based on the prior experience (e.g., associated with sensory states x1 through x5 of Trails 1 and 2), the predictor may generate predicted output uP=5°, 6° at steps 1 through 5 of Trial 3, as shown in Table 4. Variations in the predictor output uP during Trial 3 may be based on the respective variations of the control signal. In accordance with sensory input and/or plant feedback, the controller may vary control signal u at steps 2 through 5. Overall, during Trial 3, the predictor is able to contribute about 58% (e.g., 28° out of 48°) to the overall control signal û. The combined control signal during Trial 3 is closer to the target output of 48°, compared to the combined output (51°) achieved at Trial 2. The rover operation during Trial 2 may be referred to as jointly controlled by the control entity and the predictor. It is noteworthy, the neither the predictor nor the controller are capable of individually providing target control signal of 45° during Trial 3.
At a subsequent trial (not shown) the control signal may be reduced to zero while the predictor output may be increased to provide the target cumulative turn (e.g., 45°).
Training results shown and described with respect to Table 3-Table 4 are characterized by different sensory context (e.g., states x1 through x5) corresponding to individual training steps. Step-to-step sensory novelty may prevent the predictor from learning control signal during the duration of the trial, as illustrated by constant predictor output uP in the data of Table 3-Table 4.
Table 5 presents training results for an adaptive predictor apparatus (e.g., 222 of
As shown in Table 5, sensory state x1 may persist throughout the training steps 1 through 3 corresponding, for example, a view of a large object being present within field of view of sensor. The sensory state x2 may persist throughout the training steps 4 through 5 corresponding, for example, another view the large object being present sensed.
At steps 1, 2 of Trial of Table 5, the controller may provide control signal comprising a 9° turn control command. At step 3, the predictor may increase its output to 3°, based on a learned association between the control signal u and the sensory state x1.
At step 3 of Trial of Table 5, the controller may reduce its output u to 7° based on the combined output u2′=12° of the prior step exceeding the target output of 9°. The predictor may increase its output based on determining a discrepancy between the sensory state x1 and its prior output (3°).
At step 4 of Trial of Table 5, the sensory state (context) may change, due to for example a different portion of the object becoming visible. The predictor output may be reduced to zero as the new context x2 may not have been previously observed.
At step 5 of Trial of Table 5, the controller may reduce its output u to 2° based on determining amount of cumulative control signal (e.g., cumulative turn) achieved at steps 1 through 4. The predictor may increase its output from zero to 3° based on determining a discrepancy between the sensory state x2 and its prior output u4P=0°. Overall, during the Trial illustrated in Table 5, the predictor is able to contribute about 25% (e.g., 5° out of 48°) to the overall control signal û.
ε(ti)=|uP(ti−1)−ud(ti)|. (Eqn. 15)
In other words, the error may be determined based on (how well) the prior predictor output matches the current teaching (e.g., target) input. In one or more implementations, predictor error may comprise a root-mean-square deviation (RMSD), coefficient of variation, and/or other parameters.
As shown in
Various implementations, of methodology for training of robotic devices are now described. An exemplary training sequence of adaptive controller apparatus (e.g., 200 of
During first trial at time T1:
During another trial at time T2>T1:
During another trial at time T3>T2:
Subsequently, at times T4, T5, TM>T2 the predictor output to the combiner 234 may result in the control signal 220 to turn the plant by 45° and the control signal 208 may be reduced to zero. In some implementations, the outcome of the above operational sequence may be referred to as (gradual) transfer of the control signal to the predictor output. When the predictor is capable to producing the target output, the control signal (e.g., 208 in
In one or more implementations comprising spiking control and/or predictor signals (e.g., 208, 218, 248, 220, 240 in
In some implementations, methods 1000, 1020, 1040 may be implemented in one or more processing devices (e.g., a digital processor, an analog processor, a digital circuit designed to process information, an analog circuit designed to process information, a state machine, and/or other mechanisms for electronically processing information and/or execute computer program modules). The one or more processing devices may include one or more devices executing some or all of the operations of methods 1000, 1020, 1040 in response to instructions stored electronically on an electronic storage medium. The one or more processing devices may include one or more devices configured through hardware, firmware, and/or software to be specifically designed for execution of one or more of the operations of methods 1000, 1020, 1040.
At operation 1002 of method 1000, illustrated in
At operation 1004, an input may be received from a trainer. In some implementations, the input may comprise a control command (e.g., rotate right/left wheel and/or other command) that is based on the sensory context (e.g., appearance of a target in field of view of the robot's camera, and/or other sensory context) and provided by a human user. In one or more implementations, the teacher input signal may comprise an action indications (e.g., proceed straight towards the target) provided by a computerized agent. The input may be provided by the teacher using one or more previously developed control elements (primitives) e.g., 542, 454, 456, 564 in
At operation 1008 of method 1000, an action may be executed in accordance with the input and the context. In one or more implementations, the action execution may be based on a combined control signal, e.g., the signal 240 generated by the combiner 214 in accordance with any of the methodologies described herein (e.g., using the transfer function of Eqn. 6). The action may comprise moving forward the platform 402 of
At operation 1010 of method 1000, a determination may be made as to whether additional actions are to be performed based on additional user inputs.
Responsive to a determination that additional actions are to be performed (e.g., extend the boom 412), the method 1000 may proceed to operation 1002.
Responsive to a determination that no other additional actions are to be performed for the context of operation 1002 the method 1000 may proceed to operation 1012, wherein action sequence may be determined. In some implementations, action sequence may comprise two or more execution instances of a given action (e.g., activating forward button 1208 to move platform forward in several steps). In one or more implementations, action sequence may comprise execution of two or more individual actions (e.g., moving forward the platform 402, lowering the arm 410, extending the boom 412, and straightening the arm portion 414 of the apparatus 400 of
At operation 1014, a target performance associated with executing the actions at operation 1008 may be determined. In one or more implementations, the performance may be determined based on a deviation between the target trajectory (e.g., 630 in
Responsive to a determination that the performance is lower than the target level, the method 1000 may proceed to operation 1002 to continue training.
Responsive to a determination that the performance matches or exceeds the target level, the method 1000 may proceed to operation 1016 wherein a composite control element primitive may be generated. In some implementations, the composite primitive of operation 1016 may correspond to the composite controls 12141224, 1222 of
At operation 1022 of method 1020, a robot may be configured to perform a target action based on user input and characteristic of robot environment. In some implementations, the environment characteristic may comprise a relative positioning of the robot (e.g., 622, in
At operation 1024, learning process of the robotic may be configured to determine if the target action of operation 1022 may be decomposed into two or more sub-actions associated with previously learned primitives. By way of an illustration, a target action comprising reaching for an object with the attachment 415 of
At operation 1026, learning configuration associated with a sub-action may be accessed. In some implementations, the learning configuration may update look-up table entries and/or weights of a neuron network.
At operation 1028 of method 1020, the robot may perform an action based on the user input, sensory context and the learning configuration associated with the subtask.
At operation 1030, a determination may be made as to whether additional subtasks are to be performed. Responsive to a determination that additional subtask are to be performed, the method 1020 may proceed to operation 1026.
Responsive to a determination that no additional subtasks are to be performed, the method 1020 may proceed to operation 1032 wherein composite action learning configuration may be stored. In one or more implementations, the composite action configuration may comprise pointers to configurations associated with sub-actions and/or order of their execution.
At operation 1042, the action execution may commence. In some implementations, the training commencement may be based on a user instruction (e.g., voice command ‘start’, ‘record’, a button push, a gesture, and/or other user instruction) to a controller of the robot indicating to beginning of the composite action execution. Responsive to receipt of the execution start instruction, the controller may activate, e.g., a recording function configured to store a sequence of subsequent action.
At operation 1044 of method 1040, multiple actions may be executed by the robot using one or more available action primitives. In one or more implementation, the action execution of operation 1044 may be performed in collaboration with the user.
At operation 1046, the action execution may be terminated. In some implementations, the action termination may be based on a user instruction (e.g., voice command ‘stop’, ‘enough’, a button push, a gesture, and/or other indication) to the controller indicating the ending of the composite action execution. In one or more implementations, the action termination may be based on the ability of device to determine if the action has been successfully executed. By way of illustration, once a robot has acquired an object and brought it back, then it may be determined that the action of fetch has been successfully accomplished. In some implementations, the persistence of an action may be configured to decay over time. Responsive to receipt of the execution start instruction, the controller may deactivate, e.g., a recording.
At operation 1048, a composite primitive may be generated and a tag may be assigned. In one or more implementations, the tag may comprise an audio command (e.g., ‘forward’, ‘reach’), click pattern, and/or other indication. In some implementations, the robotic apparatus may comprise an audio processing block configured to store a characteristic (e.g., a spectrogram) associated with the command tag (e.g., the word ‘fetch’). In some implementations, the composite primitive generation may comprise storing pointers to configurations associated with sub-actions, order of their execution and/or other operations. The composite action generation may comprise provision of a control element (e.g., 1214, 1222, 1224) on a user interface device. The control element may be subsequently utilized for executing the composite action of the process 1040.
One or more objects (e.g., an obstacle 1174, a target 1176, and/or other objects) may be present in the camera field of view. The motion of the objects may result in a displacement of pixels representing the objects within successive frames, such as described in U.S. patent application Ser. No. 13/689,717, entitled “APPARATUS AND METHODS FOR OBJECT DETECTION VIA OPTICAL FLOW CANCELLATION”, filed Nov. 30, 2012, incorporated herein by reference in its entirety.
When the robotic apparatus 1160 is in motion, such as shown by arrow 1164 in
Various exemplary computerized apparatus may be utilized with the robotic training methodology of the disclosure. In some implementations, the robotic apparatus may comprise one or more processors configured to execute the adaptation methodology described herein. In some implementations, an external processing entity (e.g., a cloud service, computer station and/or cluster) may be utilized in order to perform computations during training of the robot (e.g., operations of methods 1000, 1020, 1040).
Robot training methodology described herein may advantageously enable task execution by robotic devices. In some implementations, training of the robot may be based on a collaborative training approach wherein the robot and the user collaborate on performing a task.
The collaborative training approach described herein may advantageously enable users to train robots characterized by complex dynamics wherein description of the dynamic processes of the robotic platform and/or environment may not be attainable with precision that is adequate to achieve the target task (e.g., arrive to a target within given time). The collaborative training approach may enable training of robots in changing environment (e.g., train vacuum cleaner robot to avoid displaced and/or newly placed objects while cleaning newly vacant areas.
The remote controller may comprise multiple control elements (e.g., joysticks, sliders, buttons, and/or other control elements). Individual control elements (primitives) may be utilized to (i) activate respective portions of the robot platform (e.g., actuators), (ii) activate one or more actuator with different magnitude (e.g., move forward slow, move forward fast), and/or effectuate other actions.
Based on the collaborative training, the remote controller may provide composite controls configured based on operation of two or more of control primitives. Activation of a single composite control may enable the robot to perform a task that has previously utilized activation of multiple control primitives. Further training may enable development of composite controls of higher levels in a hierarchy.
It will be recognized that while certain aspects of the disclosure are described in terms of a specific sequence of steps of a method, these descriptions are only illustrative of the broader methods of the invention, and may be modified as required by the particular application. Certain steps may be rendered unnecessary or optional under certain circumstances. Additionally, certain steps or functionality may be added to the disclosed implementations, or the order of performance of two or more steps permuted. All such variations are considered to be encompassed within the disclosure disclosed and claimed herein.
While the above detailed description has shown, described, and pointed out novel features of the disclosure as applied to various implementations, it will be understood that various omissions, substitutions, and changes in the form and details of the device or process illustrated may be made by those skilled in the art without departing from the disclosure. The foregoing description is of the best mode presently contemplated of carrying out the invention. This description is in no way meant to be limiting, but rather should be taken as illustrative of the general principles of the invention. The scope of the disclosure should be determined with reference to the claims.
| Number | Name | Date | Kind |
|---|---|---|---|
| 3920972 | Corwin, Jr. et al. | Nov 1975 | A |
| 4468617 | Ringwall | Aug 1984 | A |
| 4617502 | Sakaue et al. | Oct 1986 | A |
| 4638445 | Mattaboni | Jan 1987 | A |
| 4706204 | Hattori | Nov 1987 | A |
| 4763276 | Perreirra et al. | Aug 1988 | A |
| 4852018 | Grossberg | Jul 1989 | A |
| 5063603 | Burt | Nov 1991 | A |
| 5092343 | Spitzer | Mar 1992 | A |
| 5121497 | Kerr et al. | Jun 1992 | A |
| 5245672 | Wilson | Sep 1993 | A |
| 5303384 | Rodriguez et al. | Apr 1994 | A |
| 5355435 | DeYong | Oct 1994 | A |
| 5388186 | Bose | Feb 1995 | A |
| 5408588 | Ulug | Apr 1995 | A |
| 5467428 | Ulug | Nov 1995 | A |
| 5579440 | Brown | Nov 1996 | A |
| 5602761 | Spoerre et al. | Feb 1997 | A |
| 5612883 | Shaffer et al. | Mar 1997 | A |
| 5638359 | Peltola | Jun 1997 | A |
| 5673367 | Buckley | Sep 1997 | A |
| 5687294 | Jeong | Nov 1997 | A |
| 5719480 | Bock | Feb 1998 | A |
| 5739811 | Rosenberg et al. | Apr 1998 | A |
| 5841959 | Guiremand | Nov 1998 | A |
| 5875108 | Hoffberg | Feb 1999 | A |
| 5994864 | Inoue et al. | Nov 1999 | A |
| 6009418 | Cooper | Dec 1999 | A |
| 6014653 | Thaler | Jan 2000 | A |
| 6169981 | Werbos | Jan 2001 | B1 |
| 6218802 | Onoue et al. | Apr 2001 | B1 |
| 6243622 | Yim et al. | Jun 2001 | B1 |
| 6259988 | Galkowski et al. | Jul 2001 | B1 |
| 6272479 | Farry et al. | Aug 2001 | B1 |
| 6363369 | Liaw | Mar 2002 | B1 |
| 6366293 | Hamilton | Apr 2002 | B1 |
| 6442451 | Lapham | Aug 2002 | B1 |
| 6458157 | Suaning | Oct 2002 | B1 |
| 6489741 | Genov | Dec 2002 | B1 |
| 6493686 | Francone et al. | Dec 2002 | B1 |
| 6545705 | Sigel | Apr 2003 | B1 |
| 6545708 | Tamayama et al. | Apr 2003 | B1 |
| 6546291 | Merfeld | Apr 2003 | B2 |
| 6581046 | Ahissar | Jun 2003 | B1 |
| 6601049 | Cooper | Jul 2003 | B1 |
| 6636781 | Shen | Oct 2003 | B1 |
| 6643627 | Liaw | Nov 2003 | B2 |
| 6697711 | Yokono | Feb 2004 | B2 |
| 6703550 | Chu | Mar 2004 | B2 |
| 6760645 | Kaplan et al. | Jul 2004 | B2 |
| 6961060 | Mochizuki et al. | Nov 2005 | B1 |
| 7002585 | Watanabe | Feb 2006 | B1 |
| 7024276 | Ito | Apr 2006 | B2 |
| 7243334 | Berger et al. | Jul 2007 | B1 |
| 7324870 | Lee | Jan 2008 | B2 |
| 7342589 | Miserocchi | Mar 2008 | B2 |
| 7395251 | Linsker | Jul 2008 | B2 |
| 7398259 | Nugent | Jul 2008 | B2 |
| 7426501 | Nugent | Sep 2008 | B2 |
| 7426920 | Petersen | Sep 2008 | B1 |
| 7668605 | Braun | Feb 2010 | B2 |
| 7672920 | Ito | Mar 2010 | B2 |
| 7752544 | Cheng | Jul 2010 | B2 |
| 7849030 | Ellingsworth | Dec 2010 | B2 |
| 8015130 | Matsugu | Sep 2011 | B2 |
| 8145355 | Danko | Mar 2012 | B2 |
| 8214062 | Eguchi et al. | Jul 2012 | B2 |
| 8271134 | Kato et al. | Sep 2012 | B2 |
| 8315305 | Petre | Nov 2012 | B2 |
| 8364314 | Abdallah et al. | Jan 2013 | B2 |
| 8380652 | Francis, Jr. | Feb 2013 | B1 |
| 8419804 | Herr et al. | Apr 2013 | B2 |
| 8452448 | Pack et al. | May 2013 | B2 |
| 8467623 | Izhikevich | Jun 2013 | B2 |
| 8509951 | Glenger | Aug 2013 | B2 |
| 8571706 | Zhang et al. | Oct 2013 | B2 |
| 8639644 | Hickman et al. | Jan 2014 | B1 |
| 8655815 | Palmer et al. | Feb 2014 | B2 |
| 8751042 | Lee | Jun 2014 | B2 |
| 8793205 | Fisher | Jul 2014 | B1 |
| 8924021 | Dariush et al. | Dec 2014 | B2 |
| 8958912 | Blumberg et al. | Feb 2015 | B2 |
| 8972315 | Szatmary et al. | Mar 2015 | B2 |
| 8990133 | Ponulak et al. | Mar 2015 | B1 |
| 9008840 | Ponulak et al. | Apr 2015 | B1 |
| 9015092 | Sinyavskiy et al. | Apr 2015 | B2 |
| 9015093 | Commons | Apr 2015 | B1 |
| 9047568 | Fisher et al. | Jun 2015 | B1 |
| 9056396 | Linnell | Jun 2015 | B1 |
| 9070039 | Richert | Jun 2015 | B2 |
| 9082079 | Coenen | Jul 2015 | B1 |
| 9104186 | Sinyavskiy et al. | Aug 2015 | B2 |
| 9122994 | Piekniewski et al. | Sep 2015 | B2 |
| 9144907 | Summer et al. | Sep 2015 | B2 |
| 9186793 | Meier | Nov 2015 | B1 |
| 9189730 | Coenen et al. | Nov 2015 | B1 |
| 9193075 | Cipollini et al. | Nov 2015 | B1 |
| 9195934 | Hunt et al. | Nov 2015 | B1 |
| 9213937 | Ponulak | Dec 2015 | B2 |
| 9242372 | Laurent et al. | Jan 2016 | B2 |
| 20010045809 | Mukai | Nov 2001 | A1 |
| 20020038294 | Matsugu | Mar 2002 | A1 |
| 20020103576 | Takamura et al. | Aug 2002 | A1 |
| 20020158599 | Fujita et al. | Oct 2002 | A1 |
| 20020169733 | Peters | Nov 2002 | A1 |
| 20020175894 | Grillo | Nov 2002 | A1 |
| 20020198854 | Berenji et al. | Dec 2002 | A1 |
| 20030023347 | Konno | Jan 2003 | A1 |
| 20030050903 | Liaw | Mar 2003 | A1 |
| 20030108415 | Hosek et al. | Jun 2003 | A1 |
| 20030144764 | Yokono et al. | Jul 2003 | A1 |
| 20030220714 | Nakamura et al. | Nov 2003 | A1 |
| 20040030449 | Solomon | Feb 2004 | A1 |
| 20040036437 | Ito | Feb 2004 | A1 |
| 20040051493 | Furuta | Mar 2004 | A1 |
| 20040128028 | Miyamoto et al. | Jul 2004 | A1 |
| 20040131998 | Marom et al. | Jul 2004 | A1 |
| 20040136439 | Dewberry | Jul 2004 | A1 |
| 20040158358 | Anezaki et al. | Aug 2004 | A1 |
| 20040162638 | Solomon | Aug 2004 | A1 |
| 20040167641 | Kawai et al. | Aug 2004 | A1 |
| 20040172168 | Watanabe et al. | Sep 2004 | A1 |
| 20040193670 | Langan | Sep 2004 | A1 |
| 20040267404 | Danko | Dec 2004 | A1 |
| 20050004710 | Shimomura | Jan 2005 | A1 |
| 20050008227 | Duan et al. | Jan 2005 | A1 |
| 20050015351 | Nugent | Jan 2005 | A1 |
| 20050036649 | Yokono | Feb 2005 | A1 |
| 20050049749 | Watanabe et al. | Mar 2005 | A1 |
| 20050054381 | Lee et al. | Mar 2005 | A1 |
| 20050065651 | Ayers | Mar 2005 | A1 |
| 20050069207 | Zakrzewski et al. | Mar 2005 | A1 |
| 20050113973 | Endo et al. | May 2005 | A1 |
| 20050119791 | Nagashima | Jun 2005 | A1 |
| 20050125099 | Mikami | Jun 2005 | A1 |
| 20050283450 | Matsugu | Dec 2005 | A1 |
| 20060069448 | Yasui | Mar 2006 | A1 |
| 20060082340 | Watanabe et al. | Apr 2006 | A1 |
| 20060094001 | Torre | May 2006 | A1 |
| 20060129277 | Wu et al. | Jun 2006 | A1 |
| 20060129506 | Edelman et al. | Jun 2006 | A1 |
| 20060149489 | Joublin et al. | Jul 2006 | A1 |
| 20060161218 | Danilov | Jul 2006 | A1 |
| 20060161300 | Gonzalez-Banos et al. | Jul 2006 | A1 |
| 20060167530 | Flaherty et al. | Jul 2006 | A1 |
| 20060181236 | Bogardh | Aug 2006 | A1 |
| 20060189900 | Flaherty et al. | Aug 2006 | A1 |
| 20060207419 | Okazaki et al. | Sep 2006 | A1 |
| 20060230140 | Aoyama | Oct 2006 | A1 |
| 20060250101 | Khatib et al. | Nov 2006 | A1 |
| 20070022068 | Linsker | Jan 2007 | A1 |
| 20070074177 | Kurita et al. | Mar 2007 | A1 |
| 20070100780 | Fleischer et al. | May 2007 | A1 |
| 20070112700 | Den Haan et al. | May 2007 | A1 |
| 20070151389 | Prisco et al. | Jul 2007 | A1 |
| 20070176643 | Nugent | Aug 2007 | A1 |
| 20070200525 | Kanaoka | Aug 2007 | A1 |
| 20070208678 | Matsugu | Sep 2007 | A1 |
| 20070250464 | Hamilton | Oct 2007 | A1 |
| 20070255454 | Dariush | Nov 2007 | A1 |
| 20070260356 | Kock | Nov 2007 | A1 |
| 20080024345 | Watson | Jan 2008 | A1 |
| 20080040040 | Goto et al. | Feb 2008 | A1 |
| 20080097644 | Kaznov | Apr 2008 | A1 |
| 20080100482 | Lazar | May 2008 | A1 |
| 20080112596 | Rhoads et al. | May 2008 | A1 |
| 20080133052 | Jones | Jun 2008 | A1 |
| 20080140257 | Sato et al. | Jun 2008 | A1 |
| 20080154428 | Nagatsuka | Jun 2008 | A1 |
| 20080162391 | Izhikevich | Jul 2008 | A1 |
| 20080294074 | Tong et al. | Nov 2008 | A1 |
| 20080319929 | Kaplan et al. | Dec 2008 | A1 |
| 20090037033 | Phillips | Feb 2009 | A1 |
| 20090037351 | Kristal | Feb 2009 | A1 |
| 20090043722 | Nugent | Feb 2009 | A1 |
| 20090069943 | Akashi et al. | Mar 2009 | A1 |
| 20090105786 | Fetz et al. | Apr 2009 | A1 |
| 20090231359 | Bass, II et al. | Sep 2009 | A1 |
| 20090234501 | Ishizaki | Sep 2009 | A1 |
| 20090265036 | Jamieson et al. | Oct 2009 | A1 |
| 20090272585 | Nagasaka | Nov 2009 | A1 |
| 20090287624 | Rouat | Nov 2009 | A1 |
| 20090299751 | Jung | Dec 2009 | A1 |
| 20090312817 | Hogle et al. | Dec 2009 | A1 |
| 20100036457 | Sarpeshkar | Feb 2010 | A1 |
| 20100081958 | She | Apr 2010 | A1 |
| 20100086171 | Lapstun | Apr 2010 | A1 |
| 20100119214 | Shimazaki | May 2010 | A1 |
| 20100152896 | Komatsu et al. | Jun 2010 | A1 |
| 20100152899 | Chang et al. | Jun 2010 | A1 |
| 20100166320 | Paquier | Jul 2010 | A1 |
| 20100169098 | Patch | Jul 2010 | A1 |
| 20100198765 | Fiorillo | Aug 2010 | A1 |
| 20100222924 | Gienger | Sep 2010 | A1 |
| 20100225824 | Lazar | Sep 2010 | A1 |
| 20100228264 | Robinson et al. | Sep 2010 | A1 |
| 20100286824 | Solomon | Nov 2010 | A1 |
| 20100292835 | Sugiura et al. | Nov 2010 | A1 |
| 20100299101 | Shimada | Nov 2010 | A1 |
| 20100305758 | Nishi et al. | Dec 2010 | A1 |
| 20100312730 | Weng et al. | Dec 2010 | A1 |
| 20110010006 | Tani et al. | Jan 2011 | A1 |
| 20110016071 | Guillen | Jan 2011 | A1 |
| 20110026770 | Brookshire | Feb 2011 | A1 |
| 20110035052 | McLurkin | Feb 2011 | A1 |
| 20110035188 | Martinez-Heras et al. | Feb 2011 | A1 |
| 20110040405 | Lim et al. | Feb 2011 | A1 |
| 20110060460 | Oga et al. | Mar 2011 | A1 |
| 20110060461 | Velliste et al. | Mar 2011 | A1 |
| 20110067479 | Davis et al. | Mar 2011 | A1 |
| 20110071676 | Sanders et al. | Mar 2011 | A1 |
| 20110107270 | Wang et al. | May 2011 | A1 |
| 20110110006 | Meyer et al. | May 2011 | A1 |
| 20110119214 | Breitwisch | May 2011 | A1 |
| 20110119215 | Elmegreen | May 2011 | A1 |
| 20110144802 | Jang | Jun 2011 | A1 |
| 20110158476 | Fahn et al. | Jun 2011 | A1 |
| 20110160741 | Asano et al. | Jun 2011 | A1 |
| 20110160906 | Orita et al. | Jun 2011 | A1 |
| 20110160907 | Orita | Jun 2011 | A1 |
| 20110196199 | Donhowe | Aug 2011 | A1 |
| 20110208350 | Eliuk et al. | Aug 2011 | A1 |
| 20110218676 | Okazaki | Sep 2011 | A1 |
| 20110231016 | Goulding | Sep 2011 | A1 |
| 20110244919 | Aller et al. | Oct 2011 | A1 |
| 20110282169 | Grudic et al. | Nov 2011 | A1 |
| 20110296944 | Carter | Dec 2011 | A1 |
| 20110319714 | Roelle et al. | Dec 2011 | A1 |
| 20120008838 | Guyon et al. | Jan 2012 | A1 |
| 20120011090 | Tang | Jan 2012 | A1 |
| 20120011093 | Aparin et al. | Jan 2012 | A1 |
| 20120017232 | Hoffberg et al. | Jan 2012 | A1 |
| 20120036099 | Venkatraman et al. | Feb 2012 | A1 |
| 20120045068 | Kim et al. | Feb 2012 | A1 |
| 20120053728 | Theodorus | Mar 2012 | A1 |
| 20120071752 | Sewell et al. | Mar 2012 | A1 |
| 20120079670 | Yoon et al. | Apr 2012 | A1 |
| 20120109866 | Modha | May 2012 | A1 |
| 20120143495 | Dantu | Jun 2012 | A1 |
| 20120144242 | Vichare et al. | Jun 2012 | A1 |
| 20120150777 | Setoguchi et al. | Jun 2012 | A1 |
| 20120150781 | Arthur | Jun 2012 | A1 |
| 20120173021 | Tsusaka | Jul 2012 | A1 |
| 20120185092 | Ku | Jul 2012 | A1 |
| 20120197439 | Wang | Aug 2012 | A1 |
| 20120209428 | Mizutani | Aug 2012 | A1 |
| 20120209432 | Fleischer | Aug 2012 | A1 |
| 20120221147 | Goldberg et al. | Aug 2012 | A1 |
| 20120296471 | Inaba et al. | Nov 2012 | A1 |
| 20120303091 | Izhikevich | Nov 2012 | A1 |
| 20120303160 | Ziegler et al. | Nov 2012 | A1 |
| 20120308076 | Piekniewski | Dec 2012 | A1 |
| 20120308136 | Izhikevich | Dec 2012 | A1 |
| 20130000480 | Komatsu et al. | Jan 2013 | A1 |
| 20130006468 | Koehrsen et al. | Jan 2013 | A1 |
| 20130019325 | Deisseroth | Jan 2013 | A1 |
| 20130066468 | Choi et al. | Mar 2013 | A1 |
| 20130073080 | Ponulak | Mar 2013 | A1 |
| 20130073484 | Izhikevich | Mar 2013 | A1 |
| 20130073491 | Izhikevich | Mar 2013 | A1 |
| 20130073492 | Izhikevich | Mar 2013 | A1 |
| 20130073493 | Modha | Mar 2013 | A1 |
| 20130073495 | Izhikevich | Mar 2013 | A1 |
| 20130073496 | Szatmary | Mar 2013 | A1 |
| 20130073498 | Izhikevich | Mar 2013 | A1 |
| 20130073499 | Izhikevich | Mar 2013 | A1 |
| 20130073500 | Szatmary | Mar 2013 | A1 |
| 20130096719 | Sanders | Apr 2013 | A1 |
| 20130116827 | Inazumi | May 2013 | A1 |
| 20130151442 | Suh et al. | Jun 2013 | A1 |
| 20130151448 | Ponulak | Jun 2013 | A1 |
| 20130151449 | Ponulak | Jun 2013 | A1 |
| 20130151450 | Ponulak | Jun 2013 | A1 |
| 20130172906 | Olson et al. | Jul 2013 | A1 |
| 20130173060 | Yoo et al. | Jul 2013 | A1 |
| 20130206170 | Svendsen et al. | Aug 2013 | A1 |
| 20130218339 | Maisonnier et al. | Aug 2013 | A1 |
| 20130218821 | Szatmary | Aug 2013 | A1 |
| 20130245829 | Ohta et al. | Sep 2013 | A1 |
| 20130251278 | Izhikevich | Sep 2013 | A1 |
| 20130274924 | Chung et al. | Oct 2013 | A1 |
| 20130297541 | Piekniewski et al. | Nov 2013 | A1 |
| 20130297542 | Piekniewski | Nov 2013 | A1 |
| 20130310979 | Herr et al. | Nov 2013 | A1 |
| 20130325244 | Wang | Dec 2013 | A1 |
| 20130325766 | Petre et al. | Dec 2013 | A1 |
| 20130325768 | Sinyavskiy | Dec 2013 | A1 |
| 20130325773 | Sinyavskiy | Dec 2013 | A1 |
| 20130325774 | Sinyavskiy et al. | Dec 2013 | A1 |
| 20130325775 | Sinyavskiy | Dec 2013 | A1 |
| 20130325776 | Ponulak | Dec 2013 | A1 |
| 20130325777 | Petre | Dec 2013 | A1 |
| 20130345718 | Crawford et al. | Dec 2013 | A1 |
| 20130346347 | Patterson et al. | Dec 2013 | A1 |
| 20140012788 | Piekniewski | Jan 2014 | A1 |
| 20140016858 | Richert | Jan 2014 | A1 |
| 20140025613 | Ponulak | Jan 2014 | A1 |
| 20140027718 | Zhao | Jan 2014 | A1 |
| 20140032458 | Sinyavskiy et al. | Jan 2014 | A1 |
| 20140032459 | Sinyavskiy et al. | Jan 2014 | A1 |
| 20140052679 | Sinyavskiy et al. | Feb 2014 | A1 |
| 20140081895 | Coenen | Mar 2014 | A1 |
| 20140089232 | Buibas | Mar 2014 | A1 |
| 20140114479 | Okazaki | Apr 2014 | A1 |
| 20140122397 | Richert et al. | May 2014 | A1 |
| 20140122398 | Richert | May 2014 | A1 |
| 20140156574 | Piekniewski et al. | Jun 2014 | A1 |
| 20140163729 | Shi et al. | Jun 2014 | A1 |
| 20140187519 | Cooke et al. | Jul 2014 | A1 |
| 20140193066 | Richert | Jul 2014 | A1 |
| 20140222739 | Ponulak | Aug 2014 | A1 |
| 20140229411 | Richert et al. | Aug 2014 | A1 |
| 20140244557 | Piekniewski et al. | Aug 2014 | A1 |
| 20140277718 | Izhikevich | Sep 2014 | A1 |
| 20140277744 | Coenen | Sep 2014 | A1 |
| 20140298212 | Wen | Oct 2014 | A1 |
| 20140309659 | Roh et al. | Oct 2014 | A1 |
| 20140350723 | Prieto et al. | Nov 2014 | A1 |
| 20140358284 | Laurent et al. | Dec 2014 | A1 |
| 20140358828 | Phillipps et al. | Dec 2014 | A1 |
| 20140369558 | Holz | Dec 2014 | A1 |
| 20140371907 | Passot et al. | Dec 2014 | A1 |
| 20140371912 | Passot et al. | Dec 2014 | A1 |
| 20150032258 | Passot et al. | Jan 2015 | A1 |
| 20150066479 | Pasupalak | Mar 2015 | A1 |
| 20150094850 | Passot et al. | Apr 2015 | A1 |
| 20150094852 | Laurent et al. | Apr 2015 | A1 |
| 20150120128 | Rosenstein et al. | Apr 2015 | A1 |
| 20150127149 | Sinyavskiy et al. | May 2015 | A1 |
| 20150127154 | Passot et al. | May 2015 | A1 |
| 20150127155 | Passot et al. | May 2015 | A1 |
| 20150148956 | Negishi | May 2015 | A1 |
| 20150185027 | Kikkeri et al. | Jul 2015 | A1 |
| 20150204559 | Hoffberg et al. | Jul 2015 | A1 |
| 20150283701 | Izhikevich et al. | Oct 2015 | A1 |
| 20150283702 | Izhikevich et al. | Oct 2015 | A1 |
| 20150283703 | Izhikevich et al. | Oct 2015 | A1 |
| 20150306761 | O'Connor et al. | Oct 2015 | A1 |
| 20150317357 | Harmsen et al. | Nov 2015 | A1 |
| 20150338204 | Richert et al. | Nov 2015 | A1 |
| 20150339589 | Fisher | Nov 2015 | A1 |
| 20150339826 | Buibas et al. | Nov 2015 | A1 |
| 20150341633 | Richert | Nov 2015 | A1 |
| 20160004923 | Piekniewski et al. | Jan 2016 | A1 |
| 20160014426 | Richert | Jan 2016 | A1 |
| Number | Date | Country |
|---|---|---|
| 102226740 | Oct 2011 | CN |
| 2384863 | Nov 2011 | EP |
| 4087423 | Mar 1992 | JP |
| 2003175480 | Jun 2003 | JP |
| 2108612 | Oct 1998 | RU |
| 2008083335 | Jul 2008 | WO |
| 20100136961 | Dec 2010 | WO |
| WO2011039542 | Apr 2011 | WO |
| WO2012151585 | Nov 2012 | WO |
| Entry |
|---|
| Abbott et al. (2000), “Synaptic plasticity: taming the beast”, Nature Neuroscience, 3, 1178-1183. |
| Bartlett et al., “Convexity, Classification, and Risk Bounds” Jun. 16, 2005, pp. 1-61. |
| Bartlett et al., “Large margin classifiers: convex loss, low noise, and convergence rates” Dec. 8, 2003, 8 pgs. |
| Bohte, “Spiking Nueral Networks” Doctorate at the University of Leiden, Holland, Mar. 5, 2003, pp. 1-133 [retrieved on Nov. 14, 2012]. Retrieved from the internet: <URL: http://homepages.cwi.nl/-sbohte/publication/phdthesis.pdf>. |
| Brette et al., Brain: a simple and flexible simulator for spiking neural networks, The Neuromorphic Engineer, Jul. 1, 2009, pp. 1-4, doi: 10.2417/1200906.1659. |
| Cessac et al. “Overview of facts and issues about neural coding by spikes.” Journal of Physiology, Paris 104.1 (2010): 5. |
| Cuntz et al., “One Rule to Grow Them All: A General Theory of Neuronal Branching and Its Paractical Application” PLOS Computational Biology, 6 (8), Published Aug. 5, 2010. |
| Davison et al., PyNN: a common interface for neuronal network simulators, Frontiers in Neuroinformatics, Jan. 2009, pp. 1-10, vol. 2, Article 11. |
| Djurfeldt, Mikael, The Connection-set Algebra: a formalism for the representation of connectivity structure in neuronal network models, implementations in Python and C++, and their use in simulators BMC Neuroscience Jul. 18, 2011 p. 1 12(Suppl 1):P80. |
| Dorval et al. “Probability distributions of the logarithm of inter-spike intervals yield accurate entropy estimates from small datasets.” Journal of neuroscience methods 173.1 (2008): 129. |
| Fidjeland et al. “Accelerated Simulation of Spiking Neural Networks Using GPUs” WCCI 2010 IEEE World Congress on Computational Intelligience, Jul. 18-23, 2010—CCIB, Barcelona, Spain, pp. 536-543, [retrieved on Nov. 14, 2012]. Retrieved from the Internet: <URL:http://www.doc.ic.ac.ukl-mpsha/IJCNN10b.pdf>. |
| Floreano et al., “Neuroevolution: from architectures to learning” Evol. Intel. Jan. 2008 1:47-62, [retrieved Dec. 30, 2013] [retrieved online from URL:<http://inforscience.epfl.ch/record/112676/files/FloreanoDuerrMattiussi2008.pdf>. |
| Gewaltig et al., NEST (Neural Simulation Tool), Scholarpedia, 2007, pp. 1-15, 2( 4 ):1430, doi: 1 0.4249/scholarpedia.1430. |
| Gleeson et al., ) NeuroML: A Language for Describing Data Driven Models of Neurons and Networks with a High Degree of Biological Detail, PLoS Computational Biology, Jun. 2010, pp. 1-19 vol. 6 Issue 6. |
| Gollisch et al. “Rapid neural coding in the retina with relative spike latencies.” Science 319.5866 (2008): 11 08-1111. |
| Goodman et al., Brian: a simulator for spiking neural networks in Python, Frontiers in Neuroinformatics, Nov. 2008, pp. 1-10, vol. 2, Article 5. |
| Gorchetchnikov et al., NineML: declarative, mathematically-explicit descriptions of spiking neuronal networks, Frontiers in Neuroinformatics, Conference Abstract: 4th INCF Congress of Neuroinformatics, doi: 1 0.3389/conf.fninf.2011.08.00098. |
| Graham, Lyle J., The Surf-Hippo Reference Manual, http://www.neurophys.biomedicale.univparis5. fr/-graham/surf-hippo-files/Surf-Hippo%20Reference%20Manual.pdf, Mar. 2002, pp. 1-128. |
| Izhikevich, “Polychronization: Computation with Spikes”, Neural Computation, 25, 2006, 18, 245-282. |
| Izhikevich et al., “Relating STDP to BCM”, Neural Computation (2003) 15, 1511-1523. |
| Izhikevich, “Simple Model of Spiking Neurons”, IEEE Transactions on Neural Networks, vol. 14, No. 6, Nov. 2003, pp. 1569-1572. |
| Jin et al. (2010) “Implementing Spike-Timing-Dependent Plasticity on SpiNNaker Neuromorphic Hardware”, WCCI 2010, IEEE World Congress on Computational Intelligence. |
| Karbowski et al., “Multispikes and Synchronization in a Large Neural Network with Temporal Delays”, Neural Computation 12, 1573-1606 (2000)). |
| Khotanzad, “Classification of invariant image representations using a neural network” IEEF. Transactions on Acoustics, Speech, and Signal Processing, vol. 38, No. 6, Jun. 1990, pp. 1028-1038 [online], [retrieved on Dec. 10, 2013]. Retrieved from the Internet <URL: http://www-ee.uta.edu/eeweb/IP/Courses/SPR/Reference/Khotanzad.pdf>. |
| Laurent, “The Neural Network Query Language (NNQL) Reference” [retrieved on Nov. 12, 2013]. Retrieved from the Internet: <URLhttps://code.google.com/p/nnql/issues/detail?id=1>. |
| Laurent, “Issue 1—nnql—Refactor Nucleus into its own file—Neural Network Query Language” [retrieved on Nov. 12, 2013]. Retrieved from the Internet: <URL:https:1/code.google.com/p/nnql/issues/detail?id=1 >. |
| Lazar et al. “A video time encoding machine”, in Proceedings of the 15th IEEE International Conference on Image Processing (ICIP '081, 2008, pp. 717-720. |
| Lazar et al. “Consistent recovery of sensory stimuli encoded with MIMO neural circuits.” Computational intelligence and neuroscience (2010): 2. |
| Lazar et al. “Multichannel time encoding with integrate-and-fire neurons.” Neurocomputing 65 (2005): 401-407. |
| Masquelier, Timothee. “Relative spike time coding and STOP-based orientation selectivity in the early visual system in natural continuous and saccadic vision: a computational model.” Journal of computational neuroscience 32.3 (2012): 425-441. |
| Nguyen et al., “Estimating divergence functionals and the likelihood ratio by penalized convex risk minimization” 2007, pp. 1-8. |
| Nichols, A Reconfigurable Computing Architecture for Implementing Artificial Neural Networks on FPGA, Master's Thesis, The University of Guelph, 2003, pp. 1-235. |
| Paugam-Moisy et al., “Computing with spiking neuron networks” G. Rozenberg T. Back, J. Kok (Eds.), Handbook of Natural Computing, Springer-Verlag (2010) [retrieved Dec. 30, 2013], [retrieved online from link.springer.com]. |
| Pavlidis et al. Spiking neural network training using evolutionary algorithms. In: Proceedings 2005 IEEE International Joint Conference on Neural Networkds, 2005. IJCNN'05, vol. 4, pp. 2190-2194 Publication Date Jul. 31, 2005 [online] [Retrieved on Dec. 10, 2013] Retrieved from the Internet <URL: http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.5.4346&rep=rep1&type=pdf. |
| Sato et al., “Pulse interval and width modulation for video transmission.” Cable Television, IEEE Transactions on 4 (1978): 165-173. |
| Schemmel et al., Implementing synaptic plasticity in a VLSI spiking neural network model in Proceedings of the 2006 International Joint Conference on Neural Networks (IJCNN'06), IEEE Press (2006) Jul. 16-21, 2006, pp. 1-6 [online], [retrieved on Dec. 10, 2013]. Retrieved from the Internet <URL: http://www.kip.uni-heidelberg.de/veroeffentlichungen/download.cgi/4620/ps/1774.pdf>. |
| Simulink® model [online], [Retrieved on Dec. 10, 2013] Retrieved from <URL: http://www.mathworks.com/products/simulink/index.html>. |
| Sinyavskiy et al. “Reinforcement learning of a spiking neural network in the task of control of an agent in a virtual discrete environment” Rus. J. Nonlin. Dyn., 2011, vol. 7, No. 4 (Mobile Robots), pp. 859-875, chapters 1-8. |
| Szatmary et al., “Spike-timing Theory of Working Memory” PLoS Computational Biology, vol. 6, Issue 8, Aug. 19, 2010 [retrieved on Dec. 30, 2013]. Retrieved from the Internet: <URL:http://www.ploscompbiol.org/article/info%3Adoi%2F10.1371%2Fjournal.pcbi.1000879#>. |
| Wang “The time dimension for scene analysis.” Neural Networks, IEEE Transactions on 16.6 (2005): 1401-1426. |
| Sjostrom et al., “Spike-Timing Dependent Plasticity” Scholarpedia, 5(2):1362 (2010), pp. 1-18. |
| Miller III, “Real-Time Application of Neural Networks for Sensor-Based Control of Robots with Vision”, IEEE Transactions on Systems, Man, and Cypernetics Jul./Aug. 1989, pp. 825-831, vol. 19, No. 4. |
| Walters, “Implementation of Self-Organizing Neural Networks for Visuo-Motor Control of an Industrial Robot”, IEEE Transactions on Neural Networks, vol. 4, No. 1, Jan. 1993, pp. 86-95. |
| Froemke et al., “Temporal Modulation of Spike-Timing-Dependent Plasticity”, Frontiers in Synaptic Neuroscience, vol. 2, article 19, Jun. 2010, pp. 1-16. |
| Grollman et al., 2007 “Dogged Learning for Robots” IEEE International Conference on Robotics and Automation (ICRA). |
| PCT International Search Report for PCT/US2014/040407 dated Oct. 17, 2014. |
| PCT International Search Report for International Application PCT/US2013/026738 dated Jul. 21, 2014. |
| Asensio et al., “Robot Learning Control Based on Neural Network Prediction” ASME 8th Annual Dynamic Systems and Control Conference joint with the JSME 11th Motion and Vibration Conference 2012 [Retrieved on: Jun. 24, 2014]. Retrieved fro internet: <http://msc.berkely.edu/wjchen/publications/DSC12—8726—FI.pdf>. |
| Bouganis et al., Training a Spiking Neural Network to Control a 4-DoF Robotic Arm based on Spiking Timing-Dependent Plasticity in WCCI 2010 IEEE World Congress on Computational Intelligence Jul. 2010 [Retrieved on Jun. 24, 2014] Retrieved from internet: http://www.doc.ic.ac.uk/˜mpsha/IJCNN10a.pdf>. |
| Kasabov, “Evolving Spiking Neural Networks for Spatio-and Spectro-Temporal Pattern Recognition”, IEEE 6th International Conference Intelligent Systems' 2012 [Retrieved on Jun. 24, 2014], Retrieved from internet: <http://ncs.ethz.ch/projects/evospike/publications/evolving-spiking-neural-networks for-spatio-and-spectro-temporal-pattern-recognition-plenary-talk-ieee-is>. |
| PCT International Search Report and Written Opinion for PCT/US14/48512 dated Jan. 23, 2015, pp. 1-14. |
| Lazar et al. “Consistent recovery of sensory stimuli encoded with MIMO neural circuits.” Computational intelligence and neuroscience (2009): 2. |
| Alvarez, ‘Review of approximation techniques’, PhD thesis, chapter 2, pp. 7-14, University of Bradford, 2000. |
| Makridakis et al., ‘Evaluating Accuracy (or Error) Measures’, INSEAD Technical Report, 1995/18/TM. |
| Chung Hyuk Park, et al., Transfer of Skills between Human Operators through Haptic Training with Robot Coordination. International Conference on Robotics and Automation Anchorage Convention District, 2010,Anchorage, Alaska, USA, pp. 229-235 [Online] [retrieved Dec. 3, 2015]. Retrieved from Internet: <URL:https://smartech.gatech.edu/bitstream/handle/1853/38279/IEE—2010—ICRA—002.pdf>. |
| http://www.braincorporation.com/specs/BStem—SpecSheet—Rev—Nov11—2013.pdf. |
| Specification, figures and EFS receipt of U.S. Appl. No. 14/265,113, filed Apr. 29, 2014 and entitled “Trainable convolutional network apparatus and methods for operating a robotic vehicle” (71 pages). |
| Specification, figures and EFS receipt of U.S. Appl. No. 14/285,385, filed May 22, 2014 and entitled “Apparatus and methods for real time estimation of differential motion in live video” (42 pages). |
| Specification, figures and EFS receipt of U.S. Appl. No. 14/285,414, filed May 22, 2014 and entitled “Apparatus and methods for distance estimation using multiple image sensors” (63 pages). |
| Specification, figures and EFS receipt of U.S. Appl. No. 14/285,466, filed May 22, 2014 and entitled “Apparatus and methods for robotic operation using video imagery” (64 pages). |
| Specification, figures and EFS receipt of U.S. Appl. No. 14/321,736, filed Jul. 1, 2014 and entitled “Optical detection apparatus and methods” (49 pages). |
| Specification, figures and EFS receipt of U.S. Appl. No. 14/326,374, filed Jul. 8, 2014 and entitled “Apparatus and methods for distance estimation using stereo imagery” (75 pages). |
| Specification, figures and EFS receipt of U.S. Appl. No. 14/489,242, filed Sep. 17, 2014 and entitled “Apparatus and methods for remotely controlling robotic devices” (100 pages). |
| Specification, figures and EFS receipt of U.S. Appl. No. 14/542,391, filed Nov. 14, 2014 and entitled “Feature detection apparatus and methods for training of robotic navigation” (83 pages). |
| Specification, figures and EFS receipt of U.S. Appl. No. 14/637,138, filed Mar. 3, 2015 and entitled “Salient features tracking apparatus and methods using visual initialization” (66 pages). |
| Specification, figures and EFS receipt of U.S. Appl. No. 14/637,164, filed Mar. 3, 2015 and entitled “Apparatus and methods for tracking salient features” (66 pages). |
| Specification, figures and EFS receipt of U.S. Appl. No. 14/637,191, filed Mar. 3, 2015 and entitled “Apparatus and methods for saliency detection based on color occurrence analysis” (66 pages). |
| Specification, figures and EFS receipt of U.S. Appl. No. 14/244,888, filed Apr. 3, 2014 and entitled “Learning apparatus and methods for control of robotic devices via spoofing” (100 pages). |
| Specification, figures and EFS receipt of U.S. Appl. No. 14/244,890, filed Apr. 3, 2014 and entitled “Apparatus and methods for remotely controlling robotic devices” (91 pages). |
| Specification, figures and EFS receipt of U.S. Appl. No. 14/244,892, filed Apr. 3, 2014 entitled “Spoofing remote control apparatus and methods” (95 pages). |
| Specification, figures and EFS receipt of U.S. Appl. No. 14/588,168, filed Dec. 31, 2014 and entitled “Apparatus and methods for training robots” (101 pages). |
| Specification, figures and EFS receipt of U.S. Appl. No. 14/705,487, filed May 6, 2015 and entitled “Persistent predictor apparatus and methods for task switching” (119 pages). |
| Branca, A Neural Network for Ego-motion Estimation from Optical Flow, publ. 1995. |
| Hatsopoulos, Visual Navigation With a Neural Network, publ. 1991. |
| Huang, Fall Detection Using Modular Neural Networks with Back-Projected Optical Flow, publ. 2007. |
| Zhou, Computation of Optical Flow Using a Neural Network, publ. 1988. |
| Graham The Surf Hippo User Manual Version 3.0 B“. Unite de Neurosiences Integratives et Computationnelles Institut Federatif de Neurobiologie Alfred Fessard CNRS. France. Mar. 2002 [retrieved Jan. 16, 2014]. [retrieved biomedical.univ-paris5.fr ]”. |
| Number | Date | Country | |
|---|---|---|---|
| 20140371912 A1 | Dec 2014 | US |
