Distributed communication of independent autonomous vehicles to provide redundancy and performance

Information

  • Patent Grant
  • 9451020
  • Patent Number
    9,451,020
  • Date Filed
    Friday, July 18, 2014
    10 years ago
  • Date Issued
    Tuesday, September 20, 2016
    8 years ago
Abstract
A method and system of distributed communication of independent autonomous vehicles to provide redundancy and performance are disclosed. In one embodiment, a set of autonomous vehicles operates in a geographically proximate area through which peer-to-peer communication sessions are established between nearby ones of the set of autonomous vehicles through an ad-hoc network based on a present geo-spatial location of each one of the set of autonomous vehicles in communication proximity to preferred adjacent ones of the set of autonomous vehicles. A central server directly coupled to each of the set of autonomous vehicles establishes centralized communication paths with each of the set of autonomous vehicles through a wide area network. The centralized server processes a communication from adjacent ones of the set of autonomous vehicles when an error condition is detected in an operational mode of a non-functional vehicle that has lost communication with the central server.
Description
FIELD OF TECHNOLOGY

This disclosure relates generally to the technical fields of communications and, in one example embodiment, to a method, apparatus, and system of distributed communication of independent autonomous vehicles to provide redundancy and performance.


BACKGROUND

The development and/or use of autonomous vehicles may be impeded by a lack of an effective system and/or method for addressing errors and/or failures of autonomous vehicles operating in an immediate area of other autonomous vehicles. Failing autonomous vehicles may not be able to communicate failures to a server and/or other autonomous vehicles operating in the immediate area. This may cause information of failed and/or failing autonomous vehicles to be lost. As a result, progress toward safe and/or effective autonomous vehicle use may be hindered and/or opportunities for technological, societal, and/or monetary advancement may be lost.


SUMMARY

A method, device and system of distributed communication of independent autonomous vehicles to provide redundancy and performance.


In one aspect, a system includes an ad-hoc network and a set of autonomous vehicles operating in a geographically proximate area through which peer-to-peer communication sessions are established between nearby ones of the set of autonomous vehicles through the ad-hoc network based on a present geo-spatial location of each one of the set of autonomous vehicles in communication proximity to preferred adjacent ones of the set of autonomous vehicles. The system further includes a wide area network and a central server directly coupled to each of the set of autonomous vehicles to establish centralized communication paths with each of the set of autonomous vehicles through the wide area network. The central server processes a communication from adjacent ones of the set of autonomous vehicles when an error condition is detected in an operational mode of a non-functional vehicle that has lost communication with the central server due to network failure, a hardware failure, a mechanical failure, and an electrical failure.


A communication preference between each of the adjacent ones of the set of autonomous vehicles in the ad-hoc network may be based on a closest physical proximity of active ones of the set of autonomous vehicles. The communication sessions established between the adjacent ones of the set of autonomous vehicles may be established in a manner that provides a geo-spatial data, a status data, and/or a telemetry data to adjacent vehicles in the ad-hoc network through a redundant array of independent disk based algorithm based on an XOR method of recreating data stored on each of the adjacent vehicles operating in a present geo-spatial area defining each of the adjacent ones of the set of autonomous vehicles.


The adjacent ones of the set of autonomous vehicles may periodically refresh local indexes of available adjacent ones of the set of autonomous vehicles (such that the adjacent ones of the set of autonomous vehicles minimize local storage requirements associated with ones of the set of autonomous vehicles that are no longer adjacent based on a changed location of adjacent ones of the set of autonomous vehicles through state based logic that determines which adjacent ones of the set of autonomous vehicles have presently moved into an adjacently established ad-hoc network including a different set of adjacent ones of the set of autonomous vehicles).


The ad-hoc networks may maintain a unique identifier in a network identification table that may be published to the central server and/or associated adjacent ad-hoc networks. Each of the ad-hoc networks may maintain a geo-fenced region through which each ad-hoc network operates and/or shares geo-fence data with adjacent ad-hoc networks to minimize network geo-spatial overlap between adjacent ad-hoc networks. Each of the unique identifiers of the ad-hoc networks may automatically persist at a geo-defined area each of the ad-hoc networks are associated unique identifiers associated with a geo-defined region in which autonomous vehicles enter and/or depart.


A particular autonomous vehicle may determine if there exists a threshold number of other autonomous vehicles in a particular ad-hoc network when determining whether the particular autonomous vehicle should leave an existing ad-hoc network of the particular autonomous vehicle in a favor of an adjacent ad-hoc network to the existing ad-hoc network. The particular autonomous vehicle may automatically announce itself as a first node in the adjacent ad-hoc network when it is a first vehicle currently in the adjacent ad-hoc network and/or a communication link between the existing ad-hoc networks may be broken because of distance from a node in the existing ad-hoc network.


Each of autonomous vehicles in the existing ad-hoc network may serve as signal extenders by repeating a signal communication in the existing ad-hoc network to facilitate communication strength between autonomous vehicles in the existing ad-hoc network. Each of the autonomous vehicles in the existing ad-hoc network may prefer communications through the existing ad-hoc network instead of communications to the central server when communicating commands related to a transient operational condition of each of the autonomous vehicles, operational instructions that are unlikely to be required beyond a current trip session of each of the autonomous vehicles, and/or based on a privacy preference of owners of each of the autonomous vehicles. The owners of each of the autonomous vehicles may optionally elect to opt-out of networked communications in any of the ad-hoc network and/or the wide area network.


The adjacent ones of the set of autonomous vehicles may automatically transmit emergency commands to the non-functional vehicle when the error condition is detected to permit the non-functional vehicle to enter a safe-mode and navigate to a safe parking location determined based on a visual mapping, a telemetric mapping, and/or a sensory fusion algorithm determining where exists the safe parking location. The set of autonomous vehicles may be a multi-rotor aircraft, a neighborhood rover, an autonomous boat, an autonomous submarine, and/or an autonomous passenger vehicle.


In another aspect, a system includes an ad-hoc network and a set of autonomous vehicles operates in a geographically proximate area through which peer-to-peer communication sessions are established between nearby ones of the set of autonomous vehicles through the ad-hoc network based on a present geo-spatial location of each one of the set of autonomous vehicles in communication proximity to preferred adjacent ones of the set of autonomous vehicles. A wide area network and a central server communicatively coupled with each of the set of autonomous vehicles to establish centralized communication paths with each of the set of autonomous vehicles through the wide area network. The central server processes a communication from adjacent ones of the set of autonomous vehicles when an error condition is detected in an operational mode of a non-functional vehicle that has lost communication with the central server. A communication preference between each of the adjacent ones of the set of autonomous vehicles is based on a closest physical proximity of active ones of the set of autonomous vehicles.


In yet another aspect, a method establishes peer-to-peer communication sessions between nearby ones of a set of autonomous vehicles operating in a geographically proximate area, through an ad-hoc network, based on a present geo-spatial location of each one of the set of autonomous vehicles in communication proximity to preferred adjacent ones of the set of autonomous vehicles. Centralized communication paths are established with each of the set of autonomous vehicles through a wide area network, using a central server directly coupled to each of the set of autonomous vehicles. A communication from adjacent ones of the set of autonomous vehicles using the central server when an error condition is detected in an operational mode of a non-functional vehicle that has lost communication with the central server due to a network failure, a hardware failure, a mechanical failure, and an electrical failure.


The methods and systems disclosed herein may be implemented in any means for achieving various aspects, and may be executed in a form of a machine-readable medium embodying a set of instructions that, when executed by a machine, cause the machine to perform any of the operations disclosed herein. Other features will be apparent from the accompanying drawings and from the detailed description that follows.





BRIEF DESCRIPTION OF THE DRAWINGS

Example embodiments are illustrated by way of example and not limitation in the figures of the accompanying drawings, in which like references indicate similar elements and in which:



FIG. 1 is a network view of a communication being sent to a central server by at least one of a set of autonomous vehicles, each of the set of autonomous vehicles being communicatively coupled with one another through peer-to-peer communication sessions in an ad-hoc network, according to one embodiment.



FIG. 2 is a functional block diagram illustrating an autonomous vehicle, according to an example embodiment.



FIG. 3 shows a network identification table illustrating data relationships between the ad-hoc network and the set of autonomous vehicles of FIG. 1, according to one embodiment.



FIG. 4 is a table view illustrating the data relationships between the set of autonomous vehicles, the ad-hoc network, and the communication session of FIG. 1, according to one embodiment.



FIG. 5 is a network overlap view of a network geo-spatial overlap between two ad-hoc networks, according to one embodiment.



FIG. 6 is a graphical process flow of a non-functioning autonomous vehicle entering a safe mode and parking in a safe parking location, according to one embodiment.



FIG. 7 is a touch screen view illustrating a command and a privacy preference of an owner, according to one embodiment.



FIG. 8 is a critical path view illustrating a flow based on time in which critical operations in creating distributed communication of independent autonomous vehicles are established, according to one embodiment.



FIG. 9 is a process flow detailing the operations involving distributed communication of independent autonomous vehicles to provide redundancy and performance, according to one embodiment.





Other features of the present embodiments will be apparent from the accompanying drawings and from the detailed description that follows.


DETAILED DESCRIPTION

Disclosed are a method and system of distributed communication of independent autonomous vehicles to provide redundancy and performance, according to one embodiment. FIG. 1 is a network view 150 of a communication being sent to a central server by at least one of a set of autonomous vehicles, each of the set of autonomous vehicles being communicatively coupled with one another through peer-to-peer communication sessions in an ad-hoc network, according to one embodiment. In particular, FIG. 1 shows a central server 100, a wide area network 101, a memory 102, a processor 104, a database 106, a set of autonomous vehicles 108, a geographically proximate area 110, an ad-hoc network 112, a peer-to-peer communication session 114, an error condition 116, a non-functional autonomous vehicle 118, a communication 120, and a centralized communication path 122.



FIG. 1 illustrates a number of operations between the central server 100 and/or ones of the set of autonomous vehicles 108. The set of autonomous vehicles 108 may include any number of autonomous vehicles 200 operating in a geographically proximate area 110 and/or an ad-hoc network 112. In one embodiment, autonomous vehicles 200 (shown in FIG. 2) of the set of autonomous vehicles 108 may need to be part of a communication network and/or coupled with and/or recognized by the central server 100. Peer-to-peer communication sessions 114 may be established between each of the set of autonomous vehicles 108 through the ad-hoc network 112. The peer-to-peer communication sessions 114 may be established based on a present geo-spatial location 708 of each of the ones of the set of autonomous vehicles 108 (e.g., based on the present geo-spatial location 708 being in the geographically proximate area 110 and/or geo-defined region of the ad-hoc network 112).


The peer-to-peer communication sessions 114 may enable geo-spatial data 504, telemetry data 506, and/or status data 408 to be communicated to and/or stored on other autonomous vehicles 200 of the set of autonomous vehicles 108 without need of the wide area network 101 and/or the central server 100. In one embodiment, autonomous vehicles 200 of the set of autonomous vehicles 108 may prefer the peer-to-peer communication sessions 114 over the centralized communication path 122 for relaying certain data (e.g., data that may only be relevant for a particular time, trip and/or context).


Circle ‘1’ of FIG. 1 illustrates an error condition 116 being detected in an operational mode 404 of the non-functional autonomous vehicle 118 through the ad-hoc network 112 (e.g., being communicated from the non-functional autonomous vehicle 118 to another vehicle of the set of autonomous vehicles 108 via the peer-to-peer communication session 114). The error condition 116 may be communicated and/or detected when the non-functional autonomous vehicle 118 loses communication with the central server 100 and/or may be associated with an operational mode 404 of the non-functional autonomous vehicle 118 that has lost communication with the central server 100. The loss of communication with the central server 100 may be due to a network failure, a hardware failure, a mechanical failure, and an electrical failure. The error condition 116 may be indicated (e.g., communicated) to all autonomous vehicles 200 of the set of autonomous vehicles 108 and/or to a particular autonomous vehicle 200 (e.g., the autonomous vehicle 200 in a closest physical proximity 510 to the non-functional autonomous vehicle 118 and/or a designated node of the set of autonomous vehicles 108).


In one embodiment, centralized communication paths 122 may be established between each ones of the set of autonomous vehicles 108 and the central server 100 through the wide area network 101 (e.g., an Internet protocol network). Circle ‘2’ shows the communication 120 being sent by the autonomous vehicle 200 of the set of autonomous vehicles 108 through the centralized communication path 122 to the central server 100. The autonomous vehicle 200 that detects the error condition 116 in the operational mode 404 of the non-functional autonomous vehicle 118 may communicate instructions back to the non-functional autonomous vehicle 118 and/or may send the communication 120 to the central server 100 through the centralized communication path 122. In one embodiment, only one communication 120 may be relayed through the wide area network 101 to the central server 100. For example, by the designated node and/or autonomous vehicle 200 that received the error condition 116 indication may send the communication 120 to the central server 100. The communication 120 may include the detected error condition 116, data communicated in the peer-to-peer communication sessions 114, and/or data regarding the status of each of the autonomous vehicles 200 in the set of autonomous vehicles 108. The decentralized communication paths and centralized communication paths 122 may work in concert to provide distributed communication of independent autonomous vehicles 200, providing redundancy and performance.



FIG. 2 is a functional block diagram 250 illustrating an autonomous vehicle, according to an example embodiment. The autonomous vehicle 200 (e.g., one of the set of autonomous vehicles 108) could be configured to operate fully or partially in an autonomous mode. For example, the autonomous vehicle 200 (e.g., a land-based vehicle, an aquatic vehicle and/or an aerial vehicle) could control itself while in the autonomous mode, and may be operable to determine a current state of the autonomous vehicle 200 and/or its environment, determine a predicted behavior of at least one other entity (e.g., vehicle, pedestrian, biker, animal) in the environment, determine a confidence level that may correspond to a likelihood of the at least one other vehicle to perform the predicted behavior, and/or control the autonomous vehicle 200 based on the determined information. While in autonomous mode, the autonomous vehicle 200 may be configured to operate without human interaction.


The autonomous vehicle 200 could include various subsystems such as a computer system 201, a propulsion system 208, a sensor system 215, a control system 230, one or more peripherals 249, as well as a power supply 258. The autonomous vehicle 200 may include more or fewer subsystems and each subsystem could include multiple elements. Further, each of the subsystems and elements of autonomous vehicle 200 could be interconnected. Thus, one or more of the described functions of the autonomous vehicle 200 may be divided up into additional functional or physical components, or combined into fewer functional or physical components. In some further examples, additional functional and/or physical components may be added to the examples illustrated by FIG. 2.


The propulsion system 208 may include components operable to provide powered motion for the autonomous vehicle 200. Depending upon the embodiment, the propulsion system 208 could include an engine/motor 210, an energy source 212, a transmission 214, and/or tires/wheels 216. The engine/motor 210 could be any combination of an internal combustion engine, an electric motor, steam engine, Stirling engine, a solar powered engine, or other types of engines and/or motors. In some embodiments, the engine/motor 210 may be configured to convert energy source 212 into mechanical energy. In some embodiments, the propulsion system 208 could include multiple types of engines and/or motors. For instance, a gas-electric hybrid vehicle could include a gasoline engine and an electric motor. Other examples are possible.


The energy source 212 could represent a source of energy that may, in full or in part, power the engine/motor 210. That is, the engine/motor 210 could be configured to convert the energy source 212 into mechanical energy. Examples of energy sources 212 include gasoline, diesel, other petroleum-based fuels, propane, other compressed gas-based fuels, ethanol, solar panels, batteries, and other sources of electrical power. The energy source(s) 212 could additionally or alternatively include any combination of fuel tanks, batteries, capacitors, and/or flywheels. The energy source 212 could also provide energy for other systems of the autonomous vehicle 200.


The transmission 214 could include elements that are operable to transmit mechanical power from the engine/motor 210 to the wheels/tires 216. To this end, the transmission 214 could include a gearbox, clutch, differential, and drive shafts. The transmission 214 could include other elements. The drive shafts could include one or more axles that could be coupled to the one or more wheels/tires 216.


The wheels/tires 216 of autonomous vehicle 200 could be configured in various formats, including a unicycle, bicycle/motorcycle, tricycle, or a four-wheel format, a treaded system. Other wheel/tire geometries are possible, such as those including six or more wheels. Any combination of the wheels/tires 216 of autonomous vehicle 200 may be operable to rotate differentially with respect to other wheels/tires 216. The wheels/tires 216 could represent at least one wheel that is fixedly attached to the transmission 214 and at least one tire coupled to a rim of the wheel that could make contact with the driving surface. The wheels/tires 216 could include any combination of metal and rubber, or another combination of materials. In one embodiment, the wheels/tires 216 may include a wheel encoding sensor.


The sensor system 215 may include a number of sensors configured to sense information about the environment of the autonomous vehicle 200. For example, the sensor system 215 could include a Global positioning system (GPS) 218, an accelerometer sensor 219, an inertial measurement unit (IMU) 220, a gyroscopic sensor 221, a Radar unit 222, a wheel encoding sensor 223, a laser rangefinder/LIDAR unit 224, a compass sensor 225, a camera 226, a stereo optical sensor 227, and/or an ultrasound unit 228. The sensor system 215 could also include sensors configured to monitor internal systems of the autonomous vehicle 200 (e.g., O.sub.2 monitor, fuel gauge, engine oil temperature). Other sensors are possible as well. One or more of the sensors included in sensor system 215 could be configured to be actuated separately and/or collectively in order to modify a position and/or an orientation of the one or more sensors.


The GPS 218 may be any sensor configured to estimate a geographic location (e.g., geo-spatial data 504) of the autonomous vehicle 200. To this end, GPS 218 could include a transceiver operable to provide information regarding the position of the autonomous vehicle 200 with respect to the Earth. In one embodiment, the GPS 218 may be communicatively coupled with the central server 100 allowing a state of the autonomous vehicle 200 and/or a location of the autonomous vehicle 200 to be relayed to the server. In one embodiment, GPS 218 may be physically associated with the autonomous vehicle 200 so that the vehicle is able to periodically (e.g., continuously, every minute, at a predetermined point) communicate its location to the central server 100 through the wide area network 101 and/or a cellular network. In one embodiment, the global positioning system 218 may be communicatively coupled with the processor 202, a memory 102 (e.g., the data storage 204), the LIDAR unit 224, the RADAR unit 222, and/or the camera 226.


The IMU 220 (Internal Measurement Unit) could include any combination of sensors (e.g., accelerometers and gyroscopes) configured to sense position and orientation changes of the autonomous vehicle 200 based on inertial acceleration. In one embodiment, the IMU 220 may be used to calculate the magnitude of deceleration (e.g., controlled by the deceleration unit 236).


The Radar unit 222 may represent a system that utilizes radio signals to sense objects within the local environment of the autonomous vehicle 200. In some embodiments, in addition to sensing the objects, the Radar unit 222 may additionally be configured to sense the speed and/or heading of the objects. The Radar unit 222 may determine a range, an altitude, a direction, a shape, and/or speed of objects. In one embodiment, the autonomous vehicle 200 may be able to travel on sidewalks, bike lanes, the road 602, in streams, rivers, in the air, and/or may be able to stop at stop lights, wait to cross the road 602, navigate vehicle and/or pedestrian traffic, obey traffic laws etc. The autonomous vehicle 200 may have upon it infrared sensors, laser sensors and/or an on board navigation.


Similarly, the laser rangefinder/LIDAR unit 224 may be any sensor configured to sense objects in the environment in which the autonomous vehicle 200 is located using lasers. Depending upon the embodiment, the laser rangefinder/LIDAR unit 224 could include one or more laser sources, a laser scanner, and one or more detectors, among other system components. The laser rangefinder/LIDAR unit 224 could be configured to operate in a coherent (e.g., using heterodyne detection) or an incoherent detection mode. The LIDAR may use ultraviolet, visible and/or near infrared light to image objects in a degree field of view. The objects imaged by the LIDAR may include non-metallic objects, metallic objects, rocks, people, vehicles, rain, snow, traffic cones, traffic lights and/or signs etc. The LIDAR may be communicatively couple to the navigation server 242 to provide remote sensing capability to the autonomous vehicle 200 such that the autonomous vehicle 200 is autonomously navigable to the destination.


The camera 226 could include one or more devices configured to capture a plurality of images of the environment of the autonomous vehicle 200. The camera 226 could be a still camera 226 or a video camera 226. The camera 226 may be a set of cameras, a single multidirectional camera, a camera with a degree view, a rotating camera, a stereo optic camera etc. The control system 230 may be configured to control operation of the autonomous vehicle 200 and its components. Accordingly, the control system 230 could include various elements include steering unit, throttle 234, brake unit (e.g., the deceleration unit 236), a sensory fusion algorithm 238, a computer vision system 240, a navigation server 242, an obstacle avoidance system 244, and a temperature control algorithm 246.


The control system 230 may include a redundant array of independent disk based algorithm 248 to establish communication sessions between autonomous vehicles 200 (e.g., autonomous vehicles 200 of the set of autonomous vehicles 108). The redundant array of independent disk based algorithm 248 may be based on one or more XOR methods of recreating data stored on each of the adjacent vehicles operating in a present geo-spatial area (e.g., the geographically proximate area 110). The peer-to-peer communication sessions 114 may be established such that a geo-spatial data 504, a status data 408, and a telemetry data 506 may be communicated to adjacent vehicles in the ad-hoc network 112 using the communication sessions. In one embodiment, this data may be stored on the data storage 204 of autonomous vehicles 200 in the ad-hoc network 112 and/or may be recreated using the pieces of data stored across the set of autonomous vehicles 108. The redundant array of independent disk based algorithm 248 may work in concert with the wireless communication system 251 to communicate and/or store data (e.g., telemetry data 506, geo-spatial data 504, status data 408, and/or commands 706 related to a transient operational condition of each of the autonomous vehicles 200, operational instructions 206 that are unlikely to be required beyond a current trip session of each of the autonomous vehicles 200, and/or based on a privacy preference 704 of owners 702 of each of the autonomous vehicles 200).


The steering unit 232 could represent any combination of mechanisms that may be operable to adjust the heading of the autonomous vehicle 200. The throttle 234 could be configured to control, for instance, the operating speed of the engine/motor 210 and, in turn, control the speed of the autonomous vehicle 200. The brake unit could include any combination of mechanisms configured to decelerate the autonomous vehicle 200. The brake unit could use friction to slow the wheels/tires 216. In other embodiments, the brake unit could convert the kinetic energy of the wheels/tires 216 to electric current. The brake unit may take other forms as well.


The sensory fusion algorithm 238 may be an algorithm (or a computer program product storing an algorithm) configured to accept data from the sensor system 215 as an input. The data may include, for example, data representing information sensed at the sensors of the sensor system 215. The sensory fusion algorithm 238 could include, for instance, a Kalman filter, Bayesian network, or other algorithm. The sensory fusion algorithm 238 could further provide various assessments based on the data from sensor system 215. Depending upon the embodiment, the assessments could include evaluations of individual objects and/or features in the environment of autonomous vehicle 200, evaluation of a particular situation, and/or evaluate possible impacts based on the particular situation. The autonomous vehicle 200 may be able to adjust its path to avoid and/or intersect with the curb and/or sidewalk (e.g., traversing the curb to move from a bike lane to a sidewalk or vice versa). Other assessments are possible. The autonomous vehicle 200 may be able to use the sensory fusion algorithm 238 to use multiple sources of data to navigate intersections (e.g., while turning in an intersection) without use of lanes, painted lines, demarcated paths etc.


The computer vision system 240 may be any system operable to process and analyze images captured by camera 226 in order to identify objects and/or features in the environment of autonomous vehicle 200 that could include traffic signals, roadway boundaries, and obstacles. The computer vision system 240 could use an object recognition algorithm, a Structure From Motion (SFM) algorithm, video tracking, and other computer vision techniques. In some embodiments, the computer vision system 240 could be additionally configured to map an environment, track objects, estimate the speed of objects, etc. The navigation and pathing system (e.g., the navigation server 242) may be any system configured to determine a driving path for the autonomous vehicle 200. The navigation and pathing system may additionally be configured to update the driving path dynamically while the autonomous vehicle 200 is in operation. In some embodiments, the navigation and pathing system could be configured to incorporate data from the sensory fusion algorithm 238, the GPS 218, and one or more predetermined maps so as to determine the driving path for autonomous vehicle 200. The obstacle avoidance system 244 could represent a control system 230 configured to identify, evaluate, and avoid or otherwise negotiate potential obstacles (e.g., pedestrians, vehicles, bicycles, sidewalks (e.g., curbs, paved sidewalks), traffic cones, downed tree branches) in the environment of the autonomous vehicle 200. The control system 230 may additionally or alternatively include components other than those shown and described.


Peripherals 249 may be configured to allow interaction between the autonomous vehicle 200 and external sensors, other vehicles, other computer systems, and/or a user. For example, Peripherals 249 could include a wireless communication system 251, the user interface 252, a microphone 254, a speaker 256, and/or the path lighting device 260. The path lighting device 260 may be a set of headlights 262 and/or a light sensor 264 to detect that an environmental brightness is below a threshold luminosity. The speaker 256 may play a message recorded (e.g., through the microphone 254 and/or a mobile device and/or computer that sends the message to the autonomous vehicle 200). The microphone 254 may pick up and/or record noise from the autonomous vehicle 200's environment. The speaker 256 may play the message (e.g., a message from one passenger of an autonomous vehicle 200 to another passenger of another autonomous vehicle 200) and/or announce actions of the autonomous vehicle 200 (e.g., announce that the autonomous vehicle 200 is rerouting and/or arriving at a destination). In one embodiment, the autonomous vehicle 200 may have one or more turn signals and/or break lights.


The speaker 256, microphone 254, and/or the wireless communication system 251 (e.g., working in concert) may record and/or play an audio message (e.g., from an occupant of an adjacent autonomous vehicle 200), enable the use of voice commands to the autonomous vehicle 200 (e.g., navigation commands), and/or play a radio and/or a television. The wireless communication system 251 may enable the autonomous vehicle 200 to communicate through a network (e.g., the wide area network 101 and/or the ad-hoc network 112) with other autonomous vehicles 200 (e.g., in the ad-hoc network 112, within the geographically proximate area 110, and/or associated with the autonomous vehicle 200 and/or owner 702 (e.g., an autonomous vehicle 200 of a friend)). In one embodiment, this communication may be used to maximize efficiency of routes through collaborative communication of traffic patterns, communicate data, and/or to form a convoy.


In an example embodiment, the Peripherals 249 could provide, for instance, means for a user (e.g., the owner 702) of the autonomous vehicle 200 to interact with the user interface 252. To this end, the user interface 252 could provide information to a user of autonomous vehicle 200. The user interface 252 could also be operable to accept input from the user via a touchscreen. The touchscreen (e.g., the touchscreen 700) may be configured to sense at least one of a position and a movement of a user's finger via capacitive sensing, resistance sensing, or a surface acoustic wave process, among other possibilities. The touchscreen may be capable of sensing finger movement in a direction parallel or planar to the touchscreen surface, in a direction normal to the touchscreen surface, or both, and may also be capable of sensing a level of pressure applied to the touchscreen surface. The touchscreen may be formed of one or more translucent or transparent insulating layers and one or more translucent or transparent conducting layers. The touchscreen may take other forms as well.


In other instances, the Peripherals 249 may provide means for the autonomous vehicle 200 to communicate with devices within its environment. The microphone 254 may be configured to receive audio (e.g., a voice command or other audio input) from a user of the autonomous vehicle 200. Similarly, the speakers 256 may be configured to output audio to the user of the autonomous vehicle 200.


In one example, the wireless communication system 251 could be configured to wirelessly communicate with one or more devices directly or via a communication network. For example, wireless communication system 251 could use 3G cellular communication, such as CDMA, EVDO, GSM/GPRS, or 4G cellular communication, such as WiMAX or LTE. Alternatively, wireless communication system 251 could communicate with a wireless local area network (WLAN), for example, using WiFi. In some embodiments, wireless communication system 251 could communicate directly with a device, for example, using an infrared link, Bluetooth, or ZigBee. Other wireless protocols, such as various vehicular communication systems, are possible within the context of the disclosure. For example, the wireless communication system 251 could include one or more dedicated short range communication 120s (DSRC) devices that could include public and/or private data communications between vehicles and/or roadside stations. The wireless communication system 251 may also enable the autonomous vehicle 200 to communicate and/or coordinate with other autonomous vehicles 200 (e.g., through communication sessions over the ad-hoc network 112).


The power supply 258 may provide power to various components of autonomous vehicle 200 and could represent, for example, a rechargeable lithium-ion, lithium-sulfur, or lead-acid battery. In some embodiments, one or more banks of such batteries could be configured to provide electrical power. Other power supply 258 materials and configurations are possible. In some embodiments, the power supply 258 and energy source 212 could be implemented together, as in some all-electric cars. In one embodiment, the autonomous vehicle 200 may autonomously direct itself to a charging station (e.g., a set non-transitory charging stations, a nearest charging station, a nearest preapproved (e.g., claimed) charging station) and/or conduct necessary operations to charge itself when an energy supply reaches a threshold level, at a certain time of day, when a certain amount of time has elapsed, when a certain distance has been traveled etc.


Many or all of the functions of autonomous vehicle 200 (e.g., the autonomous vehicle 200) could be controlled by computer system 201. Computer system 201 may include at least one processor 202 (which could include at least one microprocessor 104) that executes instructions 206 stored in a non-transitory computer readable medium, such as the data storage 204. The processor 202 may be communicatively coupled to the central server 100 through a wireless network (e.g., the network of FIG. 1) to autonomously navigate the autonomous vehicle 200 to a destination specified by the central server 100. The computer system 201 may also represent a plurality of computing devices that may serve to control individual components or subsystems of the autonomous vehicle 200 in a distributed fashion.


In some embodiments, data storage 204 may contain instructions 206 (e.g., program logic) executable by the processor 202 to execute various functions of autonomous vehicle 200, including those described above in connection with FIG. 2. Data storage 204 may contain additional instructions 206 as well, including instructions 206 to transmit data to, receive data from, interact with, and/or control one or more of the propulsion system 208, the sensor system 215, the control system 230, and the Peripherals 249. In addition to the instructions 206, the data storage 204 may store data such as roadway maps, path information, among other information. Such information may be used by the autonomous vehicle 200 and computer system 201 at during the operation of the autonomous vehicle 200 in the autonomous, semi-autonomous, and/or manual modes. The autonomous vehicle 200 may include a user interface 252 for providing information to or receiving input from a user of the autonomous vehicle 200. The user interface 252 could control or enable control of content and/or the layout of interactive images that could be displayed on the touchscreen. Further, the user interface 252 could include one or more input/output devices within the set of Peripherals 249, such as the wireless communication system 251, the touchscreen, the microphone 254, and the speaker 256.


The computer system 201 may control the function of the autonomous vehicle 200 based on inputs received from various subsystems (e.g., propulsion system 208, sensor system 215, and control system 230), as well as from the user interface 252. For example, the computer system 201 may utilize input from the control system 230 in order to control the steering unit to avoid an obstacle detected by the sensor system 215 and the obstacle avoidance system 244. Depending upon the embodiment, the computer system 201 could be operable to provide control over many aspects of the autonomous vehicle 200 and its subsystems. The components of autonomous vehicle 200 could be configured to work in an interconnected fashion with other components within or outside their respective systems. For instance, in an example embodiment, the camera 226 could capture a plurality of images that could represent information about a state of an environment of the autonomous vehicle 200 operating in an autonomous mode. The environment could include another vehicle. The computer vision system 240 could recognize the other vehicle as such based on object recognition models stored in data storage 204.


The computer system 201 could carry out several determinations based on the information. For example, the computer system 201 could determine one or more predicted behaviors of the other vehicle. The predicted behavior could be based on several factors including the current state of the autonomous vehicle 200 (e.g., vehicle speed, current lane, etc.) and the current state of the environment of the autonomous vehicle 200 (e.g., speed limit, number of available lanes, position and relative motion of other vehicles, etc.). For instance, in a first scenario, if another vehicle is rapidly overtaking the autonomous vehicle 200 from a left-hand lane, while autonomous vehicle 200 is in a center lane, one predicted behavior could be that the other vehicle will continue to overtake the autonomous vehicle 200 from the left-hand lane.


In a second scenario, if the other vehicle is overtaking autonomous vehicle 200 in the left-hand lane, but a third vehicle traveling ahead of autonomous vehicle 200 is impeding further progress in the left-hand lane, a predicted behavior could be that the other vehicle may cut in front of autonomous vehicle 200. The computer system 201 could further determine a confidence level corresponding to each predicted behavior. For instance, in the first scenario, if the left-hand lane is open for the other vehicle to proceed, the computer system 201 could determine that it is highly likely that the other vehicle will continue to overtake autonomous vehicle 200 and remain in the left-hand lane. Thus, the confidence level corresponding to the first predicted behavior (that the other vehicle will maintain its lane and continue to overtake) could be high, such as 90%.


In the second scenario, where the other vehicle is blocked by a third vehicle, the computer system 201 could determine that there is a 50% chance that the other vehicle may cut in front of autonomous vehicle 200 since the other vehicle could simply slow and stay in the left-hand lane behind the third vehicle. Accordingly, the computer system 201 could assign a 50% confidence level (or another signifier) to the second predicted behavior in which the other vehicle may cut in front of the autonomous vehicle 200.


In the example embodiment, the computer system 201 could work with data storage 204 and other systems in order to control the control system 230 based on at least on the predicted behavior, the confidence level, the current state of the autonomous vehicle 200, and the current state of the environment of the autonomous vehicle 200. In the first scenario, the computer system 201 may elect to adjust nothing as the likelihood (confidence level) of the other vehicle staying in its own lane is high. In the second scenario, the computer system 201 may elect to control autonomous vehicle 200 to slow down slightly (by reducing throttle 234) or to shift slightly to the right (by controlling steering unit) within the current lane in order to avoid a potential collision. Other examples of interconnection between the components of autonomous vehicle 200 are numerous and possible within the context of the disclosure.


Although FIG. 2 shows various components of autonomous vehicle 200, i.e., wireless communication system 251, computer system 201, data storage 204, and user interface 252, as being integrated into the autonomous vehicle 200, one or more of these components could be mounted or associated separately from the autonomous vehicle 200. For example, data storage 204 could, in part or in full, exist separate from the autonomous vehicle 200. Thus, the autonomous vehicle 200 could be provided in the form of device elements that may be located separately or together. The device elements that make up autonomous vehicle 200 could be communicatively coupled together in a wired and/or wireless fashion.



FIG. 3 shows a network identification table 350 illustrating data relationships between the ad-hoc network and the set of autonomous vehicles of FIG. 1, according to one embodiment. In particular, FIG. 3 shows a unique identifier 302, a geo-defined area 304, a geo-fence data 306, a number of autonomous vehicles 308, and a threshold number of autonomous vehicles 310.


Each ad-hoc network 112 may have an associated unique identifier 302 maintained in the network identification table. The network identification table may be published to the central server 100 and/or associated adjacent ad-hoc networks 112 (e.g., through the communication 120 sent through the centralized communication path 122). The unique identifier 302 of the ad-hoc network 112 may be associated with a geo-defined region in which autonomous vehicles 200 may enter/depart and/or may automatically persist at the geo-defined area 304 (e.g., defined by the geo-fence data 306 associated with the geo-defined region).


The geo-fence data 306 may define the geo-defined area 304, the geo-defined region and/or the geo-fenced region 502. The geo-fence data 306 may include a set of geo-spatial coordinates (e.g., geo-spatial coordinates defining the boundaries of the geo-fenced region 502). The number of autonomous vehicles 308 may be the amount of autonomous vehicles 200 operating in the ad-hoc network 112 and/or geo-defined area 304. The number of autonomous vehicles 308 may be the number of the set of autonomous vehicles 108. The threshold number of autonomous vehicles 310 may be a minimum and/or maximum number of autonomous vehicles 308.


In one embodiment, the autonomous vehicle 200 may determine whether the threshold number of autonomous vehicles 310 is satisfied before leaving the present ad-hoc network 112 for another ad-hoc network 112. The autonomous vehicle 200 may take into account the number of autonomous vehicles 308 existing in the present ad-hoc network 112 and/or in the other ad-hoc network 112. The autonomous vehicle 200 may prefer to change ad-hoc networks 112 if the change (e.g., loss of the autonomous vehicle 200 from the present ad-hoc network 112) will not drop the number of autonomous vehicles 308 of the present ad-hoc network 112 below the threshold number of autonomous vehicles 310 and/or will not cause the number of autonomous vehicles 308 of the other ad-hoc network 112 to exceed a threshold number of autonomous vehicles 310.



FIG. 4 is a table view 450 illustrating the data relationships between the set of autonomous vehicles, the ad-hoc network, and the peer-to-peer communication session of FIG. 1, according to one embodiment. FIG. 4 shows a local index 402, an operational mode 404, and a status data 408.


The set of autonomous vehicles 108 and/or each of the autonomous vehicles 200 of the set of autonomous vehicles 108 may store, access, and/or update the local index 402. In one embodiment, the local index 402 may include information regarding available autonomous vehicles 200 (e.g., autonomous vehicles of the set of autonomous vehicles 108). Autonomous vehicles 200 may use the abovementioned information to appropriately and/or optimally store information, minimizing storage requirements associated with autonomous vehicles 200 no longer available (e.g., due to changes in location of autonomous vehicles 200, changes in the number of autonomous vehicles 308 in a given ad-hoc network 112, and/or privacy preferences 704 of owners 702 of autonomous vehicles 200).


The operational mode 404 may be the status of the autonomous vehicle 200. Operational modes 404 may be an overall status and/or specific to particular systems of the autonomous vehicle 200 (e.g., electrical, mechanical, computer, hardware, and/or network (e.g., loss of connection with the central server 100). An error in the operational mode(s) 404 may be categorized as the error condition 116. The error condition 116 may include details regarding a nature of the error, a time of the error, and/or a request for correction of the error (e.g., from the central server 100 and/or an adjacent autonomous vehicle 200). The status data 408 may include information regarding the status of the autonomous vehicles 200 in the set of autonomous vehicles 108. The status data 408 may include update information regarding the operational mode 404 of the non-functional autonomous vehicle 118 and/or instructions 206 sent to the non-functional (e.g., emergency commands 604).



FIG. 5 is a network overlap view 550 of a network geo-spatial overlap between two ad-hoc networks, according to one embodiment. FIG. 5 shows a geo-fenced region 502A-C, a geo-spatial data 504, a telemetry data 506, a closest physical proximity 510, a network geo-spatial overlap 512, a node 514, an existing ad-hoc network 516, a signal extender 518, a communication link 520, a changed location 522, and an adjacently established ad-hoc network 524.


Ad-hoc network 112A may exist at the geo-fenced region 502A. The geo-fenced region 502A and/or the ad-hoc network 112A may be associated with a unique identifier 302. The geographically proximate area 110A may be and/or may include the geo-fenced region 502A. In one embodiment, the geo-spatial data 504, the status data 408, and/or the telemetry data 506 may be communicated through the peer-to-peer communication sessions 114. A communication preference between adjacent ones of the set of autonomous vehicles 108 may be based on the closest physical proximity 510 of active ones of the set of autonomous vehicles 108 (e.g., ones of the set of autonomous vehicles 108 indicated as available in the local index 402). The peer-to-peer communication session 114 may be generated between only a particular autonomous vehicle and/or the autonomous vehicle 200 in the closest physical proximity 510 to the particular autonomous vehicle.


Each ad-hoc network 112 may maintain the geo-fenced region 502 and/or share the geo-fence data 306 with other ad-hoc networks 112 in order to avoid and/or minimize the network geo-spatial overlap 512. The network geo-spatial overlap 512 may be an overlap of the ad-hoc networks 112, the geo-fenced regions 502, the geo-defined regions, the geo-defined areas 304, and/or the geographically proximate areas 110. In one embodiment, geo-fenced regions 502 (e.g., geo-defined regions and/or geo-defined areas 304) may be cooperatively adjusted in order to account for and/or correct network geo-spatial overlap 512. In one embodiment, a threshold level of network geo-spatial overlap 512 may be permitted. Autonomous vehicles 200 operating in the overlapping area may continue to operate under the original ad-hoc network 112 with which it was associated (e.g., the ad-hoc network 112 associated with the set of autonomous vehicles 108 of which the autonomous vehicle 200 operating in the network geo-spatial overlap 512 is part). In one embodiment, the autonomous vehicle 200 operating in the overlapping area may choose which ad-hoc network 112 to be associated with (e.g., by accounting for threshold number of autonomous vehicles 310 and/or planned route of the autonomous vehicle 200).


The existing ad-hoc network 516 may be an adjacent ad-hoc network 112 to the ad-hoc network 112A and/or the adjacently established ad-hoc network 524. In one embodiment, each ones of the set of autonomous vehicles 108 may perform as the signal extenders 518, repeating a signal communication (e.g., the peer-to-peer communication session 114) in the existing ad-hoc network 516 in order to strengthen communication between autonomous vehicles 200 in the existing ad-hoc network 516. In the example embodiment of FIG. 5, circle ‘1’ shows the autonomous vehicle 200 in the top left area of the existing ad-hoc network 516 sending the signal communication in the existing ad-hoc network 516. The signal communication strength is strong between the autonomous vehicle 200 in the top left area and the adjacent autonomous vehicles. However, the communication strength is weak between the autonomous vehicle 200 in the top left area and the autonomous vehicle in the bottom right area. In circle ‘2,’ the adjacent autonomous vehicles act as signal extenders 518, repeating the signal communication to the autonomous vehicle in the bottom right area. This practice of signal extension may enable communications (e.g., peer-to-peer communication sessions 114) in the existing ad-hoc network 516 to effectively reach all autonomous vehicles 200 in the existing ad-hoc network 516.


In one embodiment, an autonomous vehicle 200 may leave the existing ad-hoc network 516 in favor of the adjacently established ad-hoc network 524. The communication link 520 between the autonomous vehicle 200 that is leaving the existing ad-hoc network 516 and the existing as-hoc network may be broken based on distance between the autonomous vehicle 200 and the node 514 in the existing ad-hoc network 516. In one embodiment the distance may be a threshold distance from the node 514 (e.g., one of the set of autonomous vehicles 108 and/or the first node 312). The communication link 520 may be a link with others of the set of autonomous vehicles 108 and/or a link with the ad-hoc network 112.


In one embodiment, the distance may be a distance from the geo-fenced region 502B, the geo-defined area 304 associated with the existing ad-hoc location, and/or the geographically proximate area 110B. In one embodiment, the communication link 520 may be broken when the autonomous vehicle 200 enters the geographically proximate area 110C, the geo-fenced region 502C, and/or the geo-defined area 304 associated with the adjacently established ad-hoc network 524. The autonomous vehicle 200 leaving the existing ad-hoc network 516 may announce itself as the first node 312 in the adjacently established ad-hoc network 524 if the autonomous vehicle 200 is the first autonomous vehicle 200 currently in the adjacently established ad-hoc network 524 (e.g., when it reached the changed location 522). The autonomous vehicles 200 of the set of autonomous vehicles 108 associated with the existing ad-hoc network 516 may update local indexes 402 to account for the changed location 522 of the autonomous vehicle 200 that left the existing ad-hoc network 516 and is no longer an available autonomous vehicle 200.



FIG. 6 is a graphical process flow 650 of a non-functional autonomous vehicle of entering a safe mode and parking in a safe parking location, according to one embodiment. In particular, FIG. 6 shows a road 602, an emergency command 604, a safe mode 606, and a safe parking location 608.


In circle ‘1,’ the non-functional autonomous vehicle 118 may communicate the error condition 116 of the operational mode 404 of the non-functional autonomous vehicle 118 to others of the set of autonomous vehicles 108 through the ad-hoc network 112 (e.g., through the peer-to-peer communication session 114 and/or signal communication). The others of the set of autonomous vehicles 108 may send the error command 604 in the communication 120 sent through the centralized communication path 122 to the central server 100. The others of the set of autonomous vehicles 108 may simultaneously communicate emergency commands 604 to the non-functional autonomous vehicle 118. The emergency commands 604 may include instructions 206 and/or data that may help and/or satisfy the needs of the non-functional autonomous vehicle 118. For example, the emergency commands 604 may include geo-spatial data 504, telemetry data 506, sensor data, and/or reboot instructions. In one embodiment, the emergency commands 604 may be communicated by a particular autonomous vehicle 200 (e.g., the first node 312 and/or the autonomous vehicle 200 in the closest physical proximity 510 with the non-functional autonomous vehicle 118). The autonomous vehicle(s) 200 communicating the emergency command 604 and/or the central server 100 may contact emergency services and/or repair services in response to the error condition 116 being detected.


In circle ‘2,’ the non-functional autonomous vehicle 118 may enter the safe mode 606 using the emergency commands 604. The safe mode 606 may be a set of parameters (e.g., a speed, a set of geo-spatial directions, a proximity that must be kept between the non-functional autonomous vehicle 118 and other objects, and/or a communication setting) the non-functional autonomous vehicle 118 may be instructed to use in the case of an error in one or more operational modes 404. The emergency commands 604 may enable the central server 100 and/or other autonomous vehicles 200 to perform further diagnostics regarding the nature and/or details of the error condition 116. In one embodiment, the emergency commands 604 and/or safe mode 606 may enable other autonomous vehicles 200 and/or the central server 100 (e.g., using ones of the set of autonomous vehicles 108) to control and/or safely handle a malfunctioning autonomous vehicle 200 in the ad-hoc network 112 (e.g., an non-functional autonomous vehicle 118 not able to assess the situation and/or generate and/or execute instructions on its own).


In circle ‘3,’ the non-functional autonomous vehicle 118 may exit its area of operation (e.g., the road 602) and/or park itself (e.g., using the emergency commands 604 and/or instructions associated with the safe made) in the safe parking location 608. The safe parking location 608 may be a predetermined location (e.g., a designated safe parking location 608) and/or a location determined to be the safe parking location 608. In one embodiment, the non-functional autonomous vehicle 118 may be instructed to determine (e.g., using the sensors of the non-functional autonomous vehicle 118) where the safe parking location 608 exists. Other autonomous vehicles 200 of the set of autonomous vehicles 108 may determine where the safe parking location 608 exists and/or the central server 100 may determine where the safe parking location 608 exists.


In one embodiment, the safe parking location 608 may be in the geographically proximate area 110, the geo-defined area 304, and/or the geo-fenced region 502 of the ad-hoc network 112. The central server 100 may use data from other autonomous vehicles and/or ad-hoc networks 112 (e.g., all autonomous vehicles 200 and/or ad-hoc networks 112) to determine an upcoming (e.g., in the path of the non-functional autonomous vehicle 118), closest and/or optimal safe parking location 608. The non-functional autonomous vehicle 118 may be removed from the ad-hoc network 112 once in the safe parking location 608 and/or may be passed off to the ad-hoc network 112 associated with the safe parking location 608 if the safe parking location 608 is not associated with the ad-hoc network 112 in which the non-functional autonomous vehicle 118 experienced the error condition 116.



FIG. 7 is a touch screen view 750 illustrating a command and a privacy preference of an owner, according to one embodiment. FIG. 7 shows a touch screen 700, an owner 702, a privacy preference 704, a command 706, a present geo-spatial location 708, and a request 710.


The touch screen 700 may be the user interface 252, a display screen of the autonomous vehicle 200 and/or a mobile device of the owner 702 (e.g., a smart phone, a tablet, and/or a laptop computer). The owner 702 may be the owner of the autonomous vehicle 200. While the example embodiment of FIG. 7 is given in regards to the owner 702, it will be appreciated that the example may apply to a user of the autonomous vehicle 200.


Autonomous vehicles 200 may prefer communications through the ad-hoc network 112 over communications through the centralized communication paths 122 when communicating commands 706 related to a transient operational condition of each of the autonomous vehicles 200, operational instructions 206 that are unlikely to be required beyond a current trip session of each of the autonomous vehicles 200, and/or based on a privacy preference 704 of owners 702 of each of the autonomous vehicles 200. In one embodiment, the touch screen 700 may update the owner 702 about commands 706 received through the ad-hoc network 112. For example, the autonomous vehicle 200 may receive information that there is snow in the geographically proximate area 110 and/or may switch to four wheel drive (e.g., an operational instruction that is unlikely to be required beyond a current trip session of each of the autonomous vehicles 200). The autonomous vehicle 200 may receive a command 706 related to a transient operational condition of each of the autonomous vehicles 200 and/or inform the owner 702 (e.g., “AV3 needs help!”).


The owner 702 may be able to set the privacy preference 704 using the touch screen 700. The owner 702 may be able to opt-out of communications in the ad-hoc network 112 and/or with the central server 100 and/or to not disclose the present geo-spatial location 708 (e.g., geo-spatial data 504) of the autonomous vehicle 200. In one embodiment, the autonomous vehicle 200 may not be included in the set of autonomous vehicles 108 and/or may not be designated as an available autonomous vehicle 200 in a local index 402 if the owner 702 has opted-out of communications with the central server 100 and/or the ad-hoc network 112.


Owners 702 of autonomous vehicles 200 may be able to communicate through the ad-hoc network 112. In one embodiment, an owner 702 may send a request 710 (e.g., to communicate and/or a request 710 for a specific thing) to other owners 702 in the ad-hoc network 112. The owner 702 may be able to accept or deny the request 710 communicated by another owner 702. In one embodiment, the owner 702 may be able to choose what information associated with the autonomous vehicle 200 is shared through the centralized communication path 122 and/or the peer-to-peer communication sessions 114.



FIG. 8 is a critical path view 850 illustrating a flow based on time in which critical operations in creating distributed communication of independent autonomous vehicles 200 are established, according to one embodiment. Operation 802 may establish peer-to-peer communication sessions 114 between nearby ones of a set of autonomous vehicles 108 operating in a geographically proximate area 110, through an ad-hoc network 112, based on a present geo-spatial location 708 of each one of the set of autonomous vehicles 108 in communication proximity to preferred adjacent ones of the set of autonomous vehicles 108. Operation 804 may establish centralized communication paths 122 with each of the set of autonomous vehicles 108 through a wide area network 101 using a central server 100 directly coupled to each of the set of autonomous vehicles 108. Operation 806 may detect an error condition 116 in an operational mode 404 of a non-functional autonomous vehicle 118 that has lost communication with the central server 100 due to a network failure, a hardware failure, a mechanical failure, and/or an electrical failure and a communication 120 is sent to the centralized server. Operation 808 may process the communication 120.



FIG. 9 is a process flow 950 detailing the operations involving distributed communication of independent autonomous vehicles 200 to provide redundancy and performance, according to one embodiment. Peer-to-peer communication sessions 114 may be established between nearby ones of a set of autonomous vehicles 108 operating in a geographically proximate area 110 through an ad-hoc network 112 based on a present geo-spatial location 708 of each one of the set of autonomous vehicles 108 in communication proximity to preferred adjacent ones of the set of autonomous vehicles 108 in operation 902. Centralized communication paths 122 may be established with each of the set of autonomous vehicles 108 directly coupled to a central server 100 through a wide area network 101 in operation 904. In operation 906, the central server 100 may process a communication 120 from adjacent ones of the set of autonomous vehicles 108 when an error condition 116 is detected in an operational mode 404 of a non-functional autonomous vehicle 118 that has lost communication with the central server 100 due to at least one of a network failure, a hardware failure, a mechanical failure, and an electrical failure.


Disclosed are a method, a device and/or a system of distributed communication of independent autonomous vehicles 200 to provide redundancy and performance. In one aspect, a system includes an ad-hoc network 112 and a set of autonomous vehicles 108 operating in a geographically proximate area 110 through which peer-to-peer communication sessions 114 are established between nearby ones of the set of autonomous vehicles 108 through the ad-hoc network 112 based on a present geo-spatial location 708 of each one of the set of autonomous vehicles 108 in communication proximity to preferred adjacent ones of the set of autonomous vehicles 108. The system further includes a wide area network 101 and a central server 100 directly coupled to each of the set of autonomous vehicles 108 to establish centralized communication paths 122 with each of the set of autonomous vehicles 108 through the wide area network 101. The central server 100 processes a communication 120 from adjacent ones of the set of autonomous vehicles 108 when an error condition 116 is detected in an operational mode 404 of a non-functional autonomous vehicle 118 that has lost communication with the central server 100 due to network failure, a hardware failure, a mechanical failure, and an electrical failure.


A communication preference between each of the adjacent ones of the set of autonomous vehicles 108 in the ad-hoc network 112 may be based on a closest physical proximity 510 of active ones of the set of autonomous vehicles 108. The peer-to-peer communication sessions 114 established between the adjacent ones of the set of autonomous vehicles 108 may be established in a manner that provides a geo-spatial data 504, a status data 408, and/or a telemetry data 506 to adjacent vehicles in the ad-hoc network 112 through a redundant array of independent disk based algorithm 248 based on an XOR method of recreating data stored on each of the adjacent vehicles operating in a present geo-spatial area defining each of the adjacent ones of the set of autonomous vehicles 108.


The adjacent ones of the set of autonomous vehicles 108 may periodically refresh local indexes 402 of available adjacent ones of the set of autonomous vehicles 108 (such that the adjacent ones of the set of autonomous vehicles 108 minimize local storage requirements associated with ones of the set of autonomous vehicles 108 that are no longer adjacent based on a changed location 522 of adjacent ones of the set of autonomous vehicles 108 through state based logic that determines which adjacent ones of the set of autonomous vehicles 108 have presently moved into an adjacently established ad-hoc network 524 including a different set of adjacent ones of the set of autonomous vehicles 108).


The ad-hoc networks 112 may maintain a unique identifier 302 in a network identification table that may be published to the central server 100 and/or associated adjacent ad-hoc networks 112. Each of the ad-hoc networks 112 may maintain a geo-fenced region 502 through which each ad-hoc network 112 operates and/or shares geo-fence data 306 with adjacent ad-hoc networks 112 to minimize network geo-spatial overlap 512 between adjacent ad-hoc networks 112. Each of the unique identifiers 302 of the ad-hoc networks 112 may automatically persist at a geo-defined area 304 each of the ad-hoc networks 112 are associated unique identifiers 302 associated with a geo-defined region in which autonomous vehicles 200 enter and/or depart.


A particular autonomous vehicle 200 may determine if there exists a threshold number of other autonomous vehicles 200 in a particular ad-hoc network 112 when determining whether the particular autonomous vehicle 200 should leave an existing ad-hoc network 516 of the particular autonomous vehicle 200 in a favor of an adjacent ad-hoc network 112 to the existing ad-hoc network 516. The particular autonomous vehicle 200 may automatically announce itself as a first node 312 in the adjacent ad-hoc network 112 when it is a first vehicle currently in the adjacent ad-hoc network 112 and/or a communication link 520 between the existing ad-hoc network 516s may be broken because of distance from a node 514 in the existing ad-hoc network 516.


Each of autonomous vehicles 200 in the existing ad-hoc network 516 may serve as signal extenders 518 by repeating a signal communication in the existing ad-hoc network 516 to facilitate communication strength between autonomous vehicles 200 in the existing ad-hoc network 516. Each of the autonomous vehicles 200 in the existing ad-hoc network 516 may prefer communications through the existing ad-hoc network 516 instead of communications to the central server 100 when communicating commands 706 related to a transient operational condition of each of the autonomous vehicles 200, operational instructions 206 that are unlikely to be required beyond a current trip session of each of the autonomous vehicles 200, and/or based on a privacy preference 704 of owners 702 of each of the autonomous vehicles 200. The owners 702 of each of the autonomous vehicles 200 may optionally elect to opt-out of networked communications in any of the ad-hoc network 112 and/or the wide area network 101.


The adjacent ones of the set of autonomous vehicles 108 may automatically transmit emergency commands 604 to the non-functional autonomous vehicle 118 when the error condition 116 is detected to permit the non-functional autonomous vehicle 118 to enter a safe-mode and navigate to a safe parking location 608 determined based on a visual mapping, a telemetric mapping, and/or a sensory fusion algorithm 238 determining where exists the safe parking location 608. The set of autonomous vehicles 108 may include one or more of a multi-rotor aircraft, a neighborhood rover, an autonomous boat, an autonomous submarine, and/or an autonomous passenger vehicle.


In another aspect, a system includes an ad-hoc network 112 and a set of autonomous vehicles 108 operates in a geographically proximate area 110 through which peer-to-peer communication sessions 114 are established between nearby ones of the set of autonomous vehicles 108 through the ad-hoc network 112 based on a present geo-spatial location 708 of each one of the set of autonomous vehicles 108 in communication proximity to preferred adjacent ones of the set of autonomous vehicles 108. A wide area network 101 and a central server 100 communicatively coupled with each of the set of autonomous vehicles 108 to establish centralized communication paths 122 with each of the set of autonomous vehicles 108 through the wide area network 101. The central server 100 processes a communication 120 from adjacent ones of the set of autonomous vehicles 108 when an error condition 116 is detected in an operational mode 404 of a non-functional autonomous vehicle 118 that has lost communication with the central server 100. A communication preference between each of the adjacent ones of the set of autonomous vehicles 108 is based on a closest physical proximity 510 of active ones of the set of autonomous vehicles 108.


In yet another aspect, a method establishes peer-to-peer communication sessions 114 between nearby ones of a set of autonomous vehicles 108 operating in a geographically proximate area 110, through an ad-hoc network 112, based on a present geo-spatial location 708 of each one of the set of autonomous vehicles 108 in communication proximity to preferred adjacent ones of the set of autonomous vehicles 108. Centralized communication paths 122 are established with each of the set of autonomous vehicles 108 through a wide area network 101, using a central server 100 directly coupled to each of the set of autonomous vehicles 108. A communication 120 from adjacent ones of the set of autonomous vehicles 108 using the central server 100 when an error condition 116 is detected in an operational mode 404 of a non-functional autonomous vehicle 118 that has lost communication with the central server 100 due to a network failure, a hardware failure, a mechanical failure, and an electrical failure.


An example embodiment will now be described. In one embodiment, Joe may own an autonomous car. Joe may be riding in his autonomous car when the autonomous car loses connection with the central server 100. Joe may be able to relax as the autonomous car relays the error condition 116 to other autonomous cars in the ad-hoc network 112 and the communication 120 is communicated to the central server. Joe's autonomous car may be able to continue to operate without incident (e.g., using the emergency commands 604) and/or need for user intervention. Information related to Joe's autonomous car may not be lost as a result of the loss of connection with the central server 100.


Although the present embodiments have been described with reference to specific example embodiments, it will be evident that various modifications and changes may be made to these embodiments without departing from the broader spirit and scope of the various embodiments. For example, the various devices, algorithms, analyzers, generators, etc. described herein may be enabled and operated using hardware circuitry (e.g., CMOS based logic circuitry), firmware, software and/or any combination of hardware, firmware, and/or software (e.g., embodied in a machine readable medium). For example, the various electrical structure and methods may be embodied using transistors, logic gates, and electrical circuits (e.g., application specific integrated ASIC circuitry and/or in Digital Signal; Processor DSP circuitry).


In addition, it will be appreciated that the various operations, processes, and methods disclosed herein may be embodied in a machine-readable medium and/or a machine accessible medium compatible with a data processing system (e.g., a computer system), and may be performed in any order. Accordingly, the specification and drawings are to be regarded in an illustrative rather than a restrictive sense.

Claims
  • 1. A system, comprising: an ad-hoc network;a set of autonomous vehicles operating in a geographically proximate area through which peer-to-peer communication sessions are established between nearby ones of the set of autonomous vehicles through the ad-hoc network based on a present geo-spatial location of each one of the set of autonomous vehicles in communication proximity to preferred adjacent ones of the set of autonomous vehicles;a wide area network; anda central server directly coupled to each of the set of autonomous vehicles to establish centralized communication paths with each of the set of autonomous vehicles through the wide area network,wherein the centralized server to process a communication from adjacent ones of the set of autonomous vehicles when an error condition is detected in an operational mode of a non-functional vehicle that has lost communication with the central server due to at least one of a network failure, a hardware failure, a mechanical failure, and an electrical failure, andwherein the communication sessions established between the adjacent ones of the set of autonomous vehicles are established in a manner that provides at least one of a geo-spatial data, a status data, and a telemetry data to adjacent vehicles in the ad-hoc network through a redundant array of independent disk based algorithm based on at least one of an XOR method of recreating data stored on each of the adjacent vehicles operating in a present geo-spatial area defining each of the adjacent ones of the set of autonomous vehicles.
  • 2. The system of claim 1: wherein a communication preference between each of the adjacent ones of the set of autonomous vehicles in the ad hoc network is based on a closest physical proximity of active ones of the set of autonomous vehicles.
  • 3. The system of claim 1: wherein adjacent ones of the set of autonomous vehicles periodically refresh local indexes of available adjacent ones of the set of autonomous vehicles in a manner such that the adjacent ones of the set of autonomous vehicles minimize local storage requirements associated with ones of the set of autonomous vehicles that are no longer adjacent based on a changed location of adjacent ones of the set of autonomous vehicles through state based logic that determines which adjacent ones of the set of autonomous vehicles have presently moved into an adjacently established ad-hoc network comprising a different set of adjacent ones of the set of autonomous vehicles.
  • 4. The system of claim 3: wherein each of the ad-hoc networks maintain a unique identifier in a network identification table that is published to the central server and associated adjacent ad-hoc networks, andwherein each of the ad-hoc networks maintain a geo-fenced region through which each ad-hoc network operates and shares geo-fence data with adjacent ad-hoc networks to minimize network geo-spatial overlap between adjacent ad-hoc networks.
  • 5. The system of claim 4: wherein each of the unique identifiers of the ad-hoc networks to automatically persist at a geo-defined area such that each of the ad-hoc networks are associated unique identifiers associated with a geo-defined region in which autonomous vehicles enter and depart.
  • 6. The system of claim 5: wherein a particular autonomous vehicle to determine if there exists a threshold number of other autonomous vehicles in a particular ad-hoc network when determining whether the particular autonomous vehicle should leave an existing ad-hoc network of the particular autonomous vehicle in a favor of an adjacent ad-hoc network to the existing ad-hoc network, andwherein the particular autonomous vehicle to automatically announce itself as a first node in the adjacent ad-hoc network when it is a first vehicle currently in the adjacent ad-hoc network and a communication link between the existing ad-hoc network is broken because of distance from a node in the existing ad-hoc network.
  • 7. The system of claim 6: wherein each of autonomous vehicles in the existing ad-hoc network to serve as signal extenders by repeating a signal communication in the existing ad-hoc network to facilitate communication strength between autonomous vehicles in the existing ad-hoc network, andwherein each of the autonomous vehicles in the existing ad-hoc network to prefer communications through the existing ad-hoc network instead of communications to the central server when communicating commands related to at least one of a transient operational condition of each of the autonomous vehicles, operational instructions that are unlikely to be required beyond a current trip session of each of the autonomous vehicles, and based on a privacy preference of owners of each of the autonomous vehicles.
  • 8. The system of claim 7: wherein each of the owners of each of the autonomous vehicles optionally elect to opt-out of networked communications in any of the ad-hoc network and the centralized network.
  • 9. The system of claim 1: wherein adjacent ones of the set of autonomous vehicles automatically transmit emergency commands to the non-functional vehicle when the error condition is detected to permit the non-functional vehicle to enter a safe-mode and navigate to a safe parking location determined based on at least one of a visual mapping, a telemetric mapping, and a sensory fusion algorithm determining where exists the safe parking location, andwherein each of the set of autonomous vehicles is any one of a multi-rotor aircraft, a neighborhood rover, an autonomous boat, an autonomous submarine, and an autonomous passenger vehicle.
  • 10. A system, comprising: an ad-hoc network;a set of autonomous vehicles operating in a geographically proximate area through which peer-to-peer communication sessions are established between nearby ones of the set of autonomous vehicles through the ad-hoc network based on a present geo-spatial location of each one of the set of autonomous vehicles in communication proximity to preferred adjacent ones of the set of autonomous vehicles;a wide area network; anda central server communicatively coupled with each of the set of autonomous vehicles to establish centralized communication paths with each of the set of autonomous vehicles through the wide area network,wherein the centralized server to process a communication from adjacent ones of the set of autonomous vehicles when an error condition is detected in an operational mode of a non-functional vehicle that has lost communication with the central server,wherein a communication preference between each of the adjacent ones of the set of autonomous vehicles is based on a closest physical proximity of active ones of the set of autonomous vehicles, andwherein the communication sessions established between the adjacent ones of the set of autonomous vehicles are established in a manner that provides at least one of a geo-spatial data, a status data, and a telemetry data to adjacent vehicles in the ad-hoc network through a redundant array of independent disk based algorithm based on at least one of an XOR method of recreating data stored on each of the adjacent vehicles operating in a present geo-spatial area defining each of the adjacent ones of the set of autonomous vehicles.
  • 11. The system of claim 10: wherein the lost communication is due to at least one of a network failure, a hardware failure, a mechanical failure, and an electrical failure.
  • 12. The system of claim 10: wherein adjacent ones of the set of autonomous vehicles periodically refresh local indexes of available adjacent ones of the set of autonomous vehicles in a manner such that the adjacent ones of the set of autonomous vehicles minimize local storage requirements associated with ones of the set of autonomous vehicles that are no longer adjacent based on a changed location of adjacent ones of the set of autonomous vehicles through state based logic that determines which adjacent ones of the set of autonomous vehicles have presently moved into an adjacently established ad-hoc network comprising a different set of adjacent ones of the set of autonomous vehicles.
  • 13. The system of claim 10: wherein each of the ad-hoc networks maintain a unique identifier in a network identification table that is published to the central server and associated adjacent ad-hoc networks, wherein each of the ad-hoc networks maintain a geo-fenced region through which each ad-hoc network operates and shares geo-fence data with adjacent ad-hoc networks to minimize network geo-spatial overlap between adjacent ad-hoc network.
  • 14. The system of claim 13: wherein each of the unique identifiers of the ad-hoc networks to automatically persist at a geo-defined area such that each of the ad-hoc networks are associated unique identifiers associated with a geo-defined region in which autonomous vehicles enter and depart.
  • 15. The system of claim 14: wherein a particular autonomous vehicle to determine if there exists a threshold number of other autonomous vehicles in a particular ad-hoc network when determining whether the particular autonomous vehicle should leave an existing ad-hoc network of the particular autonomous vehicle in a favor of an adjacent ad-hoc network to the existing ad-hoc network, andwherein the particular autonomous vehicle to automatically announce itself as a first node in the adjacent ad-hoc network when it is a first vehicle currently in the adjacent ad-hoc network and a communication link between the existing ad-hoc network is broken because of distance from a node in the existing ad-hoc network.
  • 16. The system of claim 15: wherein each of autonomous vehicles in the existing ad-hoc network to serve as signal extenders by repeating a signal communication in the existing ad-hoc network to facilitate communication strength between autonomous vehicles in the existing ad-hoc network, andwherein each of the autonomous vehicles in the existing ad-hoc network to prefer communications through the existing ad-hoc network instead of communications to the central server when communicating commands related to at least one of a transient operational condition of each of the autonomous vehicles, operational instructions that are unlikely to be required beyond a current trip session of each of the autonomous vehicles, and based on a privacy preference of owners of each of the autonomous vehicles.
  • 17. The system of claim 16: wherein each of the owners of each of the autonomous vehicles optionally elect to opt-out of networked communications in any of the ad-hoc network and the centralized network.
  • 18. The system of claim 10: wherein adjacent ones of the set of autonomous vehicles automatically transmit emergency commands to the non-functional vehicle when the error condition is detected to permit the non-functional vehicle to enter a safe-mode and navigate to a safe parking location determined based on at least one of a visual mapping, a telemetric mapping, and a sensory fusion algorithm determining where exists the safe parking location, andwherein each of the set of autonomous vehicles is any one of a multi-rotor aircraft, a neighborhood rover, an autonomous boat, an autonomous submarine, and an autonomous passenger vehicle.
  • 19. A method, comprising: establishing peer-to-peer communication sessions between nearby ones of a set of autonomous vehicles operating in a geographically proximate area, through an ad-hoc network, based on a present geo-spatial location of each one of the set of autonomous vehicles in communication proximity to preferred adjacent ones of the set of autonomous vehicles;establishing, using a central server directly coupled to each of the set of autonomous vehicles, centralized communication paths with each of the set of autonomous vehicles through a wide area network,processing a communication from adjacent ones of the set of autonomous vehicles using the centralized server when an error condition is detected in an operational mode of a non-functional vehicle that has lost communication with the central server due to at least one of a network failure, a hardware failure, a mechanical failure, and an electrical failure, andestablishing the communication sessions established between the adjacent ones of the set of autonomous vehicles in a manner that provides at least one of a geo-spatial data, a status data, and a telemetry data to adjacent vehicles in the ad-hoc network through a redundant array of independent disk based algorithm based on at least one of an XOR method of recreating data stored on each of the adjacent vehicles operating in a present geo-spatial area defining each of the adjacent ones of the set of autonomous vehicles.
  • 20. The method of claim 19, further comprising: basing a communication preference between each of the adjacent ones of the set of autonomous vehicles on a closest physical proximity of active ones of the set of autonomous vehicles.
  • 21. The method of claim 19, further comprising: enabling adjacent ones of the set of autonomous vehicles to periodically refresh local indexes of available adjacent ones of the set of autonomous vehicles in a manner such that the adjacent ones of the set of autonomous vehicles minimize local storage requirements associated with ones of the set of autonomous vehicles that are no longer adjacent based on a changed location of adjacent ones of the set of autonomous vehicles through state based logic that determines which adjacent ones of the set of autonomous vehicles have presently moved into an adjacently established ad-hoc network comprising a different set of adjacent ones of the set of autonomous vehicles.
  • 22. The method of claim 21, further comprising: permitting each of the ad-hoc networks to maintain a unique identifier in a network identification table that is published to the central server and associated adjacent ad-hoc networks, wherein each of the ad-hoc networks maintain a geo-fenced region through which each ad-hoc network operates and shares geo-fence data with adjacent ad-hoc networks to minimize network geo-spatial overlap between adjacent ad-hoc network.
  • 23. The method of claim 19, further comprising: enabling the unique identifiers of the ad-hoc networks to automatically persist at a geo-defined area such that each of the ad-hoc networks are associated unique identifiers associated with a geo-defined region in which autonomous vehicles enter and depart; andenabling adjacent ones of the set of autonomous vehicles to automatically transmit emergency commands to the non-functional vehicle when the error condition is detected to permit the non-functional vehicle to enter a safe-mode and navigate to a safe parking location determined based on at least one of a visual mapping, a telemetric mapping, and a sensory fusion algorithm determining where exists the safe parking location,wherein each of the set of autonomous vehicles is any one of a multi-rotor aircraft, a neighborhood rover, an autonomous boat, an autonomous submarine, and an autonomous passenger vehicle.
  • 24. The method of claim 23: wherein a particular autonomous vehicle to determine if there exists a threshold number of other autonomous vehicles in a particular ad-hoc network when determining whether the particular autonomous vehicle should leave an existing ad-hoc network of the particular autonomous vehicle in a favor of an adjacent ad-hoc network to the existing ad-hoc network, andwherein the particular autonomous vehicle to automatically announce itself as a first node in the adjacent ad-hoc network when it is a first vehicle currently in the adjacent ad-hoc network and a communication link between the existing ad-hoc network is broken because of distance from a node in the existing ad-hoc network.
  • 25. The system of claim 24: wherein each of autonomous vehicles in the existing ad-hoc network to serve as signal extenders by repeating a signal communication in the existing ad-hoc network to facilitate communication strength between autonomous vehicles in the existing ad-hoc network, andwherein each of the autonomous vehicles in the existing ad-hoc network to prefer communications through the existing ad-hoc network instead of communications to the central server when communicating commands related to at least one of a transient operational condition of each of the autonomous vehicles, operational instructions that are unlikely to be required beyond a current trip session of each of the autonomous vehicles, and based on a privacy preference of owners of each of the autonomous vehicles.
  • 26. The system of claim 25: wherein each of the owners of each of the autonomous vehicles optionally elect to opt-out of networked communications in any of the ad-hoc network and the centralized network.
  • 27. The system of claim 19: wherein adjacent ones of the set of autonomous vehicles automatically transmit emergency commands to the non-functional vehicle when the error condition is detected to permit the non-functional vehicle to enter a safe-mode and navigate to a safe parking location determined based on at least one of a visual mapping, a telemetric mapping, and a sensory fusion algorithm determining where exists the safe parking location, andwherein each of the set of autonomous vehicles is any one of a multi-rotor aircraft, a neighborhood rover, an autonomous boat, an autonomous submarine, and an autonomous passenger vehicle.
  • 28. A system, comprising: an ad-hoc network;a set of autonomous vehicles operating in a geographically proximate area through which peer-to-peer communication sessions are established between nearby ones of the set of autonomous vehicles through the ad-hoc network based on a present geo-spatial location of each one of the set of autonomous vehicles in communication proximity to preferred adjacent ones of the set of autonomous vehicles;a wide area network; anda central server directly coupled to each of the set of autonomous vehicles to establish centralized communication paths with each of the set of autonomous vehicles through the wide area network,wherein the centralized server to process a communication from adjacent ones of the set of autonomous vehicles when an error condition is detected in an operational mode of a non-functional vehicle that has lost communication with the central server due to at least one of a network failure, a hardware failure, a mechanical failure, and an electrical failure, andwherein adjacent ones of the set of autonomous vehicles periodically refresh local indexes of available adjacent ones of the set of autonomous vehicles in a manner such that the adjacent ones of the set of autonomous vehicles minimize local storage requirements associated with ones of the set of autonomous vehicles that are no longer adjacent based on a changed location of adjacent ones of the set of autonomous vehicles through state based logic that determines which adjacent ones of the set of autonomous vehicles have presently moved into an adjacently established ad-hoc network comprising a different set of adjacent ones of the set of autonomous vehicles.
  • 29. The system of claim 28: wherein a communication preference between each of the adjacent ones of the set of autonomous vehicles in the ad hoc network is based on a closest physical proximity of active ones of the set of autonomous vehicles.
  • 30. The system of claim 28: wherein each of the ad-hoc networks maintain a unique identifier in a network identification table that is published to the central server and associated adjacent ad-hoc networks, andwherein each of the ad-hoc networks maintain a geo-fenced region through which each ad-hoc network operates and shares geo-fence data with adjacent ad-hoc networks to minimize network geo-spatial overlap between adjacent ad-hoc networks.
  • 31. The system of claim 30: wherein each of the unique identifiers of the ad-hoc networks to automatically persist at a geo-defined area such that each of the ad-hoc networks are associated unique identifiers associated with a geo-defined region in which autonomous vehicles enter and depart.
  • 32. The system of claim 31: wherein a particular autonomous vehicle to determine if there exists a threshold number of other autonomous vehicles in a particular ad-hoc network when determining whether the particular autonomous vehicle should leave an existing ad-hoc network of the particular autonomous vehicle in a favor of an adjacent ad-hoc network to the existing ad-hoc network, andwherein the particular autonomous vehicle to automatically announce itself as a first node in the adjacent ad-hoc network when it is a first vehicle currently in the adjacent ad-hoc network and a communication link between the existing ad-hoc network is broken because of distance from a node in the existing ad-hoc network.
  • 33. The system of claim 32: wherein each of autonomous vehicles in the existing ad-hoc network to serve as signal extenders by repeating a signal communication in the existing ad-hoc network to facilitate communication strength between autonomous vehicles in the existing ad-hoc network, andwherein each of the autonomous vehicles in the existing ad-hoc network to prefer communications through the existing ad-hoc network instead of communications to the central server when communicating commands related to at least one of a transient operational condition of each of the autonomous vehicles, operational instructions that are unlikely to be required beyond a current trip session of each of the autonomous vehicles, and based on a privacy preference of owners of each of the autonomous vehicles.
  • 34. The system of claim 33: wherein each of the owners of each of the autonomous vehicles optionally elect to opt-out of networked communications in any of the ad-hoc network and the centralized network.
  • 35. The system of claim 28: wherein adjacent ones of the set of autonomous vehicles automatically transmit emergency commands to the non-functional vehicle when the error condition is detected to permit the non-functional vehicle to enter a safe-mode and navigate to a safe parking location determined based on at least one of a visual mapping, a telemetric mapping, and a sensory fusion algorithm determining where exists the safe parking location, andwherein each of the set of autonomous vehicles is any one of a multi-rotor aircraft, a neighborhood rover, an autonomous boat, an autonomous submarine, and an autonomous passenger vehicle.
  • 36. A system, comprising: an ad-hoc network;a set of autonomous vehicles operating in a geographically proximate area through which peer-to-peer communication sessions are established between nearby ones of the set of autonomous vehicles through the ad-hoc network based on a present geo-spatial location of each one of the set of autonomous vehicles in communication proximity to preferred adjacent ones of the set of autonomous vehicles;a wide area network; anda central server communicatively coupled with each of the set of autonomous vehicles to establish centralized communication paths with each of the set of autonomous vehicles through the wide area network,wherein the centralized server to process a communication from adjacent ones of the set of autonomous vehicles when an error condition is detected in an operational mode of a non-functional vehicle that has lost communication with the central server,wherein a communication preference between each of the adjacent ones of the set of autonomous vehicles is based on a closest physical proximity of active ones of the set of autonomous vehicles, andwherein adjacent ones of the set of autonomous vehicles periodically refresh local indexes of available adjacent ones of the set of autonomous vehicles in a manner such that the adjacent ones of the set of autonomous vehicles minimize local storage requirements associated with ones of the set of autonomous vehicles that are no longer adjacent based on a changed location of adjacent ones of the set of autonomous vehicles through state based logic that determines which adjacent ones of the set of autonomous vehicles have presently moved into an adjacently established ad-hoc network comprising a different set of adjacent ones of the set of autonomous vehicles.
  • 37. The system of claim 36: wherein the lost communication is due to at least one of a network failure, a hardware failure, a mechanical failure, and an electrical failure.
  • 38. The system of claim 36: wherein each of the ad-hoc networks maintain a unique identifier in a network identification table that is published to the central server and associated adjacent ad-hoc networks, wherein each of the ad-hoc networks maintain a geo-fenced region through which each ad-hoc network operates and shares geo-fence data with adjacent ad-hoc networks to minimize network geo-spatial overlap between adjacent ad-hoc network.
  • 39. The system of claim 38: wherein each of the unique identifiers of the ad-hoc networks to automatically persist at a geo-defined area such that each of the ad-hoc networks are associated unique identifiers associated with a geo-defined region in which autonomous vehicles enter and depart.
  • 40. The system of claim 39: wherein a particular autonomous vehicle to determine if there exists a threshold number of other autonomous vehicles in a particular ad-hoc network when determining whether the particular autonomous vehicle should leave an existing ad-hoc network of the particular autonomous vehicle in a favor of an adjacent ad-hoc network to the existing ad-hoc network, andwherein the particular autonomous vehicle to automatically announce itself as a first node in the adjacent ad-hoc network when it is a first vehicle currently in the adjacent ad-hoc network and a communication link between the existing ad-hoc network is broken because of distance from a node in the existing ad-hoc network.
  • 41. The system of claim 40: wherein each of autonomous vehicles in the existing ad-hoc network to serve as signal extenders by repeating a signal communication in the existing ad-hoc network to facilitate communication strength between autonomous vehicles in the existing ad-hoc network, andwherein each of the autonomous vehicles in the existing ad-hoc network to prefer communications through the existing ad-hoc network instead of communications to the central server when communicating commands related to at least one of a transient operational condition of each of the autonomous vehicles, operational instructions that are unlikely to be required beyond a current trip session of each of the autonomous vehicles, and based on a privacy preference of owners of each of the autonomous vehicles.
  • 42. The system of claim 41: wherein each of the owners of each of the autonomous vehicles optionally elect to opt-out of networked communications in any of the ad-hoc network and the centralized network.
  • 43. The system of claim 36: wherein adjacent ones of the set of autonomous vehicles automatically transmit emergency commands to the non-functional vehicle when the error condition is detected to permit the non-functional vehicle to enter a safe-mode and navigate to a safe parking location determined based on at least one of a visual mapping, a telemetric mapping, and a sensory fusion algorithm determining where exists the safe parking location, andwherein each of the set of autonomous vehicles is any one of a multi-rotor aircraft, a neighborhood rover, an autonomous boat, an autonomous submarine, and an autonomous passenger vehicle.
  • 44. A method, comprising: establishing peer-to-peer communication sessions between nearby ones of a set of autonomous vehicles operating in a geographically proximate area, through an ad-hoc network, based on a present geo-spatial location of each one of the set of autonomous vehicles in communication proximity to preferred adjacent ones of the set of autonomous vehicles;establishing, using a central server directly coupled to each of the set of autonomous vehicles, centralized communication paths with each of the set of autonomous vehicles through a wide area network;processing a communication from adjacent ones of the set of autonomous vehicles using the centralized server when an error condition is detected in an operational mode of a non-functional vehicle that has lost communication with the central server due to at least one of a network failure, a hardware failure, a mechanical failure, and an electrical failure; andenabling adjacent ones of the set of autonomous vehicles to periodically refresh local indexes of available adjacent ones of the set of autonomous vehicles in a manner such that the adjacent ones of the set of autonomous vehicles minimize local storage requirements associated with ones of the set of autonomous vehicles that are no longer adjacent based on a changed location of adjacent ones of the set of autonomous vehicles through state based logic that determines which adjacent ones of the set of autonomous vehicles have presently moved into an adjacently established ad-hoc network comprising a different set of adjacent ones of the set of autonomous vehicles.
  • 45. The method of claim 44, further comprising: basing a communication preference between each of the adjacent ones of the set of autonomous vehicles on a closest physical proximity of active ones of the set of autonomous vehicles.
  • 46. The method of claim 44, further comprising: permitting each of the ad-hoc networks to maintain a unique identifier in a network identification table that is published to the central server and associated adjacent ad-hoc networks, wherein each of the ad-hoc networks maintain a geo-fenced region through which each ad-hoc network operates and shares geo-fence data with adjacent ad-hoc networks to minimize network geo-spatial overlap between adjacent ad-hoc network.
  • 47. The method of claim 44, further comprising: enabling the unique identifiers of the ad-hoc networks to automatically persist at a geo-defined area such that each of the ad-hoc networks are associated unique identifiers associated with a geo-defined region in which autonomous vehicles enter and depart; andenabling adjacent ones of the set of autonomous vehicles to automatically transmit emergency commands to the non-functional vehicle when the error condition is detected to permit the non-functional vehicle to enter a safe-mode and navigate to a safe parking location determined based on at least one of a visual mapping, a telemetric mapping, and a sensory fusion algorithm determining where exists the safe parking location,wherein each of the set of autonomous vehicles is any one of a multi-rotor aircraft, a neighborhood rover, an autonomous boat, an autonomous submarine, and an autonomous passenger vehicle.
  • 48. The method of claim 47: wherein a particular autonomous vehicle to determine if there exists a threshold number of other autonomous vehicles in a particular ad-hoc network when determining whether the particular autonomous vehicle should leave an existing ad-hoc network of the particular autonomous vehicle in a favor of an adjacent ad-hoc network to the existing ad-hoc network, andwherein the particular autonomous vehicle to automatically announce itself as a first node in the adjacent ad-hoc network when it is a first vehicle currently in the adjacent ad-hoc network and a communication link between the existing ad-hoc network is broken because of distance from a node in the existing ad-hoc network.
  • 49. The system of claim 48: wherein each of autonomous vehicles in the existing ad-hoc network to serve as signal extenders by repeating a signal communication in the existing ad-hoc network to facilitate communication strength between autonomous vehicles in the existing ad-hoc network, andwherein each of the autonomous vehicles in the existing ad-hoc network to prefer communications through the existing ad-hoc network instead of communications to the central server when communicating commands related to at least one of a transient operational condition of each of the autonomous vehicles, operational instructions that are unlikely to be required beyond a current trip session of each of the autonomous vehicles, and based on a privacy preference of owners of each of the autonomous vehicles.
  • 50. The system of claim 49: wherein each of the owners of each of the autonomous vehicles optionally elect to opt-out of networked communications in any of the ad-hoc network and the centralized network.
  • 51. The system of claim 44: wherein adjacent ones of the set of autonomous vehicles automatically transmit emergency commands to the non-functional vehicle when the error condition is detected to permit the non-functional vehicle to enter a safe-mode and navigate to a safe parking location determined based on at least one of a visual mapping, a telemetric mapping, and a sensory fusion algorithm determining where exists the safe parking location, andwherein each of the set of autonomous vehicles is any one of a multi-rotor aircraft, a neighborhood rover, an autonomous boat, an autonomous submarine, and an autonomous passenger vehicle.
US Referenced Citations (1051)
Number Name Date Kind
2035218 Bloom Mar 1936 A
3253806 Eickmann May 1966 A
3556438 Meditz Jan 1971 A
3762669 Curci Oct 1973 A
4119163 Ball Oct 1978 A
4161843 Hui Jul 1979 A
4375354 Henriksson Mar 1983 A
4556198 Tominaga Dec 1985 A
4779203 McClure et al. Oct 1988 A
4914605 Loughmiller, Jr. et al. Apr 1990 A
4996468 Field et al. Feb 1991 A
5032989 Tornetta Jul 1991 A
5050844 Hawk Sep 1991 A
5199686 Fletcher Apr 1993 A
5208750 Kurami et al. May 1993 A
5325294 Keene Jun 1994 A
5372211 Wilcox et al. Dec 1994 A
5521817 Burdoin et al. May 1996 A
5577567 Johnson et al. Nov 1996 A
5581630 Bonneau, Jr. Dec 1996 A
5584025 Keithley et al. Dec 1996 A
5590062 Nagamitsu et al. Dec 1996 A
5617319 Arakawa et al. Apr 1997 A
5630103 Smith et al. May 1997 A
5671342 Millier et al. Sep 1997 A
5720363 Kipp Feb 1998 A
5751245 Janky et al. May 1998 A
5774133 Neave et al. Jun 1998 A
5794207 Walker et al. Aug 1998 A
5805810 Maxwell Sep 1998 A
5819269 Uomini Oct 1998 A
5826244 Huberman Oct 1998 A
5831664 Wharton et al. Nov 1998 A
5835896 Fisher et al. Nov 1998 A
5852810 Sotiroff et al. Dec 1998 A
5904214 Lin May 1999 A
5905499 McDowall et al. May 1999 A
5907322 Kelly et al. May 1999 A
5926765 Sasaki Jul 1999 A
5930474 Dunworth et al. Jul 1999 A
5937413 Hyun et al. Aug 1999 A
5940806 Danial Aug 1999 A
5991737 Chen Nov 1999 A
6024288 Gottlich et al. Feb 2000 A
6029141 Bezos et al. Feb 2000 A
6029195 Herz Feb 2000 A
6034618 Tatebayashi et al. Mar 2000 A
6036601 Heckel Mar 2000 A
6047194 Andersson Apr 2000 A
6047236 Hancock et al. Apr 2000 A
6049778 Walker et al. Apr 2000 A
6059263 Otema et al. May 2000 A
6073138 de l'Etraz et al. Jun 2000 A
6078906 Huberman Jun 2000 A
6088702 Plantz et al. Jul 2000 A
6092076 McDonough et al. Jul 2000 A
6092105 Goldman Jul 2000 A
6101484 Halbert et al. Aug 2000 A
6108639 Walker et al. Aug 2000 A
6122592 Arakawa et al. Sep 2000 A
6134486 Kanayama Oct 2000 A
6148260 Musk et al. Nov 2000 A
6148289 Virdy Nov 2000 A
6175831 Weinreich et al. Jan 2001 B1
6199076 Logan et al. Mar 2001 B1
6229533 Farmer et al. May 2001 B1
6236990 Geller et al. May 2001 B1
6269369 Robertson Jul 2001 B1
6308177 Israni et al. Oct 2001 B1
6317718 Fano Nov 2001 B1
6336111 Ashby et al. Jan 2002 B1
6339745 Novik Jan 2002 B1
6356834 Hancock et al. Mar 2002 B2
6381537 Chenault et al. Apr 2002 B1
6401085 Gershman et al. Jun 2002 B1
6405123 Rennard et al. Jun 2002 B1
6408307 Semple et al. Jun 2002 B1
6445983 Dickson et al. Sep 2002 B1
6453339 Schultz et al. Sep 2002 B1
6470268 Ashcraft et al. Oct 2002 B1
6480885 Olivier Nov 2002 B1
6487583 Harvey et al. Nov 2002 B1
6498982 Bellesfield et al. Dec 2002 B2
6507776 Fox, III Jan 2003 B1
6513069 Abato et al. Jan 2003 B1
6519629 Harvey et al. Feb 2003 B2
6532007 Matsuda Mar 2003 B1
6542813 Kovacs Apr 2003 B1
6542817 Miyaki Apr 2003 B2
6542936 Mayle et al. Apr 2003 B1
6557013 Ziff et al. Apr 2003 B1
6587787 Yokota Jul 2003 B1
6597983 Hancock Jul 2003 B2
6600418 Francis et al. Jul 2003 B2
6611751 Warren Aug 2003 B2
6615039 Eldering Sep 2003 B1
6622086 Polidi Sep 2003 B2
6629136 Naidoo Sep 2003 B1
6633311 Douvikas et al. Oct 2003 B1
6636803 Hartz, Jr. et al. Oct 2003 B1
6640187 Chenault et al. Oct 2003 B1
6643663 Dabney et al. Nov 2003 B1
6646568 MacPhail et al. Nov 2003 B2
6647383 August et al. Nov 2003 B1
6654800 Rieger, III Nov 2003 B1
6658410 Sakamaki et al. Dec 2003 B1
6662016 Buckham et al. Dec 2003 B1
6672601 Hofheins et al. Jan 2004 B1
6677894 Sheynblat et al. Jan 2004 B2
6684196 Mini et al. Jan 2004 B1
6687878 Eintracht et al. Feb 2004 B1
6691105 Virdy Feb 2004 B1
6691114 Nakamura Feb 2004 B1
6711414 Lightman et al. Mar 2004 B1
6716101 Meadows et al. Apr 2004 B1
6719570 Tsuchioka Apr 2004 B2
6721748 Knight et al. Apr 2004 B1
6728635 Hamada et al. Apr 2004 B2
6745196 Colyer et al. Jun 2004 B1
6750881 Appelman Jun 2004 B1
6798407 Benman Sep 2004 B1
6816850 Culliss Nov 2004 B2
6819267 Edmark et al. Nov 2004 B1
6834229 Rafiah et al. Dec 2004 B2
6847823 Lehikoinen et al. Jan 2005 B2
6871140 Florance et al. Mar 2005 B1
6882307 Gifford Apr 2005 B1
6883748 Yoeli Apr 2005 B2
6889213 Douvikas et al. May 2005 B1
6907405 Brett Jun 2005 B2
6918576 Finkbeiner Jul 2005 B2
6926233 Corcoran, III Aug 2005 B1
6931419 Lindquist Aug 2005 B1
6950791 Bray et al. Sep 2005 B1
6963879 Colver et al. Nov 2005 B2
6968179 De Vries Nov 2005 B1
6968513 Rinebold et al. Nov 2005 B1
6974123 Latvys Dec 2005 B2
6976031 Toupal et al. Dec 2005 B1
6978284 McBrearty et al. Dec 2005 B2
6983139 Dowling et al. Jan 2006 B2
6987976 Kohar et al. Jan 2006 B2
7006881 Hoffberg et al. Feb 2006 B1
7013292 Hsu et al. Mar 2006 B1
7024397 Donahue Apr 2006 B1
7024455 Yokobori et al. Apr 2006 B2
7038681 Scott et al. May 2006 B2
7047202 Jaipuria et al. May 2006 B2
7050909 Nichols et al. May 2006 B2
7068309 Toyama et al. Jun 2006 B2
7069308 Abrams Jun 2006 B2
7072849 Filepp et al. Jul 2006 B1
7076409 Agrawala et al. Jul 2006 B2
7076741 Miyaki Jul 2006 B2
7079943 Flann et al. Jul 2006 B2
7080019 Hurzeler Jul 2006 B1
7080096 Imamura Jul 2006 B1
7085650 Anderson Aug 2006 B2
7099745 Ebert Aug 2006 B2
7099862 Fitzpatrick et al. Aug 2006 B2
7117254 Lunt et al. Oct 2006 B2
7130702 Morrell Oct 2006 B2
7136915 Rieger, III Nov 2006 B2
7155336 Dorfman et al. Dec 2006 B2
7158878 Rasmussen et al. Jan 2007 B2
7174301 Florance et al. Feb 2007 B2
7177872 Schwesig et al. Feb 2007 B2
7178720 Strubbe et al. Feb 2007 B1
7184990 Walker et al. Feb 2007 B2
7188056 Kagarlis Mar 2007 B2
7188080 Walker et al. Mar 2007 B1
7188153 Lunt et al. Mar 2007 B2
7209803 Okamoto et al. Apr 2007 B2
7218993 Yasukawa et al. May 2007 B2
7228232 Bodin et al. Jun 2007 B2
7233942 Nye Jun 2007 B2
7249123 Elder et al. Jul 2007 B2
7249732 Sanders, Jr. et al. Jul 2007 B2
7251647 Hoblit Jul 2007 B2
7254559 Florance et al. Aug 2007 B2
7269590 Hull et al. Sep 2007 B2
7293019 Dumais et al. Nov 2007 B2
7296026 Patrick et al. Nov 2007 B2
7306186 Kusic Dec 2007 B2
7324810 Nave et al. Jan 2008 B2
7343564 Othmer Mar 2008 B2
7353034 Haney Apr 2008 B2
7353114 Rohlf et al. Apr 2008 B1
7353199 DiStefano, III Apr 2008 B1
7359871 Paasche et al. Apr 2008 B1
7359894 Liebman et al. Apr 2008 B1
7373244 Kreft May 2008 B2
7375618 Quintos May 2008 B2
7383251 Might Jun 2008 B2
7386542 Maybury et al. Jun 2008 B2
7389210 Kagarlis Jun 2008 B2
7424438 Vianello Sep 2008 B2
7424541 Bourne Sep 2008 B2
7426970 Olsen Sep 2008 B2
7433832 Bezos et al. Oct 2008 B1
7433868 Satomi et al. Oct 2008 B1
7437368 Kolluri et al. Oct 2008 B1
7441031 Shrinivasan et al. Oct 2008 B2
7444241 Grimm Oct 2008 B2
7447509 Cossins et al. Nov 2008 B2
7447685 Nye Nov 2008 B2
7447771 Taylor Nov 2008 B1
7454524 Jeong Nov 2008 B2
7475953 Osborn et al. Jan 2009 B2
7477285 Johnson Jan 2009 B1
7478324 Ohtsu Jan 2009 B1
7480867 Racine et al. Jan 2009 B1
7483960 Kyusojin Jan 2009 B2
7487114 Florance et al. Feb 2009 B2
7496603 Deguchi et al. Feb 2009 B2
7500258 Eldering Mar 2009 B1
7505919 Richardson Mar 2009 B2
7505929 Angert et al. Mar 2009 B2
7520466 Bostan Apr 2009 B2
7525276 Eaton Apr 2009 B2
7561169 Carroll Jul 2009 B2
7562023 Yamamoto Jul 2009 B2
7580862 Montelo et al. Aug 2009 B1
7581702 Olson et al. Sep 2009 B2
7587276 Gold et al. Sep 2009 B2
7596511 Hall et al. Sep 2009 B2
7599795 Blumberg et al. Oct 2009 B1
7599935 La Rotonda et al. Oct 2009 B2
7617048 Simon et al. Nov 2009 B2
7636687 Foster et al. Dec 2009 B2
7640204 Florance et al. Dec 2009 B2
7658346 Goossen Feb 2010 B2
7668405 Gallagher Feb 2010 B2
7669123 Zuckerberg et al. Feb 2010 B2
7680673 Wheeler Mar 2010 B2
7680859 Schiller Mar 2010 B2
7693953 Middleton et al. Apr 2010 B2
7702545 Compton et al. Apr 2010 B1
7725492 Sittig et al. May 2010 B2
7734254 Frost et al. Jun 2010 B2
7751971 Chang et al. Jul 2010 B2
7761789 Erol et al. Jul 2010 B2
7792815 Aravamudan et al. Sep 2010 B2
7797256 Zuckerberg et al. Sep 2010 B2
7801542 Stewart Sep 2010 B1
7802290 Bansal et al. Sep 2010 B1
7808378 Hayden Oct 2010 B2
7809709 Harrison, Jr. Oct 2010 B1
7809805 Stremel et al. Oct 2010 B2
7810037 Edwards et al. Oct 2010 B1
7812717 Cona et al. Oct 2010 B1
7823073 Holmes et al. Oct 2010 B2
7827052 Scott et al. Nov 2010 B2
7827120 Evans et al. Nov 2010 B1
7827208 Bosworth et al. Nov 2010 B2
7827265 Cheever et al. Nov 2010 B2
7831917 Karam Nov 2010 B1
7840224 Vengroff et al. Nov 2010 B2
7840319 Zhong Nov 2010 B2
7840558 Wiseman et al. Nov 2010 B2
7848765 Phillips et al. Dec 2010 B2
7853518 Cagan Dec 2010 B2
7853563 Alvarado et al. Dec 2010 B2
7860889 Martino et al. Dec 2010 B1
7870199 Galli et al. Jan 2011 B2
7873471 Gieseke Jan 2011 B2
7881864 Smith Feb 2011 B2
7886024 Kelly et al. Feb 2011 B2
7894933 Mountz et al. Feb 2011 B2
7894939 Zini et al. Feb 2011 B2
7894981 Yamane et al. Feb 2011 B2
7904366 Pogust Mar 2011 B2
7913179 Sheha et al. Mar 2011 B2
7933808 Garcia Apr 2011 B2
7933810 Morgenstern Apr 2011 B2
7945653 Zuckerberg et al. May 2011 B2
7949714 Burnim May 2011 B1
7958011 Cretney et al. Jun 2011 B1
7961986 Jing et al. Jun 2011 B1
7962281 Rasmussen et al. Jun 2011 B2
7966567 Abhyanker Jun 2011 B2
7969606 Chu Jun 2011 B2
7970657 Morgenstern Jun 2011 B2
7980808 Chilson et al. Jul 2011 B2
7991703 Watkins Aug 2011 B1
7996109 Zini et al. Aug 2011 B2
7996270 Sundaresan Aug 2011 B2
8010230 Zini et al. Aug 2011 B2
8027943 Juan et al. Sep 2011 B2
8046309 Evans et al. Oct 2011 B2
8051089 Gargi et al. Nov 2011 B2
8060389 Johnson Nov 2011 B2
8060555 Grayson et al. Nov 2011 B2
8064590 Abhyanker Nov 2011 B2
8065291 Knorr Nov 2011 B2
8095430 Abhyanker Jan 2012 B2
8103734 Galli et al. Jan 2012 B2
8107879 Pering et al. Jan 2012 B2
8108501 Birnie et al. Jan 2012 B2
8112419 Hancock et al. Feb 2012 B2
8117486 Handley Feb 2012 B2
8136145 Fetterman et al. Mar 2012 B2
8139514 Weber et al. Mar 2012 B2
8145661 Billman et al. Mar 2012 B1
8145703 Frishert et al. Mar 2012 B2
8149113 Diem Apr 2012 B2
8167234 Moore May 2012 B1
8171128 Zuckerberg et al. May 2012 B2
8190357 Abhyanker et al. May 2012 B2
8190476 Urbanski et al. May 2012 B2
8195601 Law et al. Jun 2012 B2
8195744 Julia et al. Jun 2012 B2
8204624 Zini et al. Jun 2012 B2
8204776 Abhyanker Jun 2012 B2
8204952 Stremel et al. Jun 2012 B2
8223012 Diem Jul 2012 B1
8225376 Zuckerberg et al. Jul 2012 B2
8229470 Ranjan et al. Jul 2012 B1
8249943 Zuckerberg et al. Aug 2012 B2
8271057 Levine et al. Sep 2012 B2
8275546 Xiao et al. Sep 2012 B2
8290943 Carbone et al. Oct 2012 B2
8292215 Olm et al. Oct 2012 B2
8296373 Bosworth et al. Oct 2012 B2
8301743 Curran et al. Oct 2012 B2
8315389 Qiu et al. Nov 2012 B2
8326091 Jing et al. Dec 2012 B1
8326315 Phillips et al. Dec 2012 B2
8328130 Goossen Dec 2012 B2
8352183 Thota et al. Jan 2013 B2
8364757 Scott et al. Jan 2013 B2
8370003 So et al. Feb 2013 B2
8380382 Sung et al. Feb 2013 B2
8380638 Watkins Feb 2013 B1
8391789 Palin et al. Mar 2013 B2
8391909 Stewart Mar 2013 B2
8401771 Krumm et al. Mar 2013 B2
8402094 Bosworth et al. Mar 2013 B2
8402372 Gillespie et al. Mar 2013 B2
8412576 Urbanski Apr 2013 B2
8412675 Alvarado et al. Apr 2013 B2
8427308 Baron, Sr. et al. Apr 2013 B1
8428565 Middleton et al. Apr 2013 B2
8433609 Abhyanker Apr 2013 B2
8433650 Thomas Apr 2013 B1
8438156 Redstone et al. May 2013 B2
8442923 Gross May 2013 B2
8443107 Burdette et al. May 2013 B2
8447810 Roumeliotis et al. May 2013 B2
8463295 Caralis et al. Jun 2013 B1
8463764 Fujioka et al. Jun 2013 B2
8473199 Blumberg et al. Jun 2013 B2
8493849 Fuste Vilella et al. Jul 2013 B2
8504284 Brülle-Drews et al. Aug 2013 B2
8504512 Herzog et al. Aug 2013 B2
8510268 Laforge et al. Aug 2013 B1
8521656 Zimberoff et al. Aug 2013 B2
8538458 Haney Sep 2013 B2
8543143 Chandra et al. Sep 2013 B2
8543323 Gold et al. Sep 2013 B1
8548493 Rieger, III Oct 2013 B2
8554770 Purdy Oct 2013 B2
8554852 Burnim Oct 2013 B2
8560515 Kimchi et al. Oct 2013 B2
8584091 Champion et al. Nov 2013 B2
8589330 Petersen et al. Nov 2013 B2
8594715 Stewart Nov 2013 B1
8595292 Grayson et al. Nov 2013 B2
8600602 McAndrew et al. Dec 2013 B1
8615565 Randall Dec 2013 B2
8620532 Curtis et al. Dec 2013 B2
8620827 Watkins, III Dec 2013 B1
8621374 Sheha et al. Dec 2013 B2
8626699 Xie et al. Jan 2014 B2
8627506 Vera et al. Jan 2014 B2
8649976 Kreft Feb 2014 B2
8650103 Wilf et al. Feb 2014 B2
8655873 Mitchell et al. Feb 2014 B2
8660541 Beresniewicz et al. Feb 2014 B1
8660897 Abhyanker Feb 2014 B2
8666660 Sartipi et al. Mar 2014 B2
8671095 Gross Mar 2014 B2
8671106 Lee et al. Mar 2014 B1
8683342 Van Riel Mar 2014 B2
8688594 Thomas et al. Apr 2014 B2
8694605 Burrell et al. Apr 2014 B1
8695919 Shachor et al. Apr 2014 B2
8712441 Haney Apr 2014 B2
8713055 Callahan et al. Apr 2014 B2
8713143 Centola et al. Apr 2014 B2
8718910 GuÉZiec May 2014 B2
8723679 Whisenant May 2014 B2
8732091 Abhyanker May 2014 B1
8732155 Vegnaduzzo et al. May 2014 B2
8732219 Ferries et al. May 2014 B1
8732846 D'Angelo et al. May 2014 B2
8738545 Abhyanker May 2014 B2
8775405 Gross Jul 2014 B2
D710454 Barajas et al. Aug 2014 S
8794566 Hutson Aug 2014 B2
8799253 Valliani et al. Aug 2014 B2
8825226 Worley, III et al. Sep 2014 B1
8832556 Steinberg Sep 2014 B2
20010005829 Raveis Jun 2001 A1
20010016795 Bellinger Aug 2001 A1
20010020955 Nakagawa et al. Sep 2001 A1
20010029426 Hancock et al. Oct 2001 A1
20010029501 Yokobori et al. Oct 2001 A1
20010036833 Koshima et al. Nov 2001 A1
20010037721 Hasegawa et al. Nov 2001 A1
20010042087 Kephart et al. Nov 2001 A1
20010049616 Khuzadi et al. Dec 2001 A1
20010049636 Hudda et al. Dec 2001 A1
20020019739 Juneau et al. Feb 2002 A1
20020023018 Kleinbaum Feb 2002 A1
20020026388 Roebuck Feb 2002 A1
20020029350 Cooper et al. Mar 2002 A1
20020030689 Eichel et al. Mar 2002 A1
20020038225 Klasky et al. Mar 2002 A1
20020046131 Boone et al. Apr 2002 A1
20020046243 Morris et al. Apr 2002 A1
20020049617 Lencki et al. Apr 2002 A1
20020059201 Work May 2002 A1
20020059379 Harvey et al. May 2002 A1
20020065691 Twig et al. May 2002 A1
20020065739 Florance et al. May 2002 A1
20020070967 Tanner et al. Jun 2002 A1
20020072848 Hamada et al. Jun 2002 A1
20020077060 Lehikoinen et al. Jun 2002 A1
20020077901 Katz Jun 2002 A1
20020078171 Schneider Jun 2002 A1
20020087260 Hancock et al. Jul 2002 A1
20020087506 Reddy Jul 2002 A1
20020090996 Maehiro Jul 2002 A1
20020091556 Fiala et al. Jul 2002 A1
20020097267 Dinan et al. Jul 2002 A1
20020099693 Kofsky Jul 2002 A1
20020103813 Frigon Aug 2002 A1
20020103892 Rieger Aug 2002 A1
20020124009 Hoblit Sep 2002 A1
20020124053 Adams et al. Sep 2002 A1
20020130906 Miyaki Sep 2002 A1
20020133292 Miyaki Sep 2002 A1
20020143462 Warren Oct 2002 A1
20020147638 Banerjee et al. Oct 2002 A1
20020156782 Rubert Oct 2002 A1
20020156917 Nye Oct 2002 A1
20020160762 Nave et al. Oct 2002 A1
20020161666 Fraki et al. Oct 2002 A1
20020169662 Claiborne Nov 2002 A1
20020184496 Mitchell et al. Dec 2002 A1
20020188522 McCall et al. Dec 2002 A1
20030004802 Callegari Jan 2003 A1
20030005035 Rodgers Jan 2003 A1
20030018521 Kraft et al. Jan 2003 A1
20030023489 McGuire et al. Jan 2003 A1
20030023586 Knorr Jan 2003 A1
20030033176 Hancock Feb 2003 A1
20030036958 Warmus et al. Feb 2003 A1
20030036963 Jacobson et al. Feb 2003 A1
20030055983 Callegari Mar 2003 A1
20030061503 Katz et al. Mar 2003 A1
20030063072 Brandenberg et al. Apr 2003 A1
20030064705 Desiderio Apr 2003 A1
20030065716 Kyusojin Apr 2003 A1
20030069002 Hunter et al. Apr 2003 A1
20030069693 Snapp et al. Apr 2003 A1
20030078897 Florance et al. Apr 2003 A1
20030088520 Bohrer et al. May 2003 A1
20030145093 Oren et al. Jul 2003 A1
20030154020 Polidi Aug 2003 A1
20030154213 Ahn Aug 2003 A1
20030158668 Anderson Aug 2003 A1
20030177019 Santos et al. Sep 2003 A1
20030177192 Umeki et al. Sep 2003 A1
20030182222 Rotman et al. Sep 2003 A1
20030200192 Bell et al. Oct 2003 A1
20030218253 Avanzino et al. Nov 2003 A1
20030220807 Hoffman et al. Nov 2003 A1
20030222918 Coulthard Dec 2003 A1
20030225632 Tong et al. Dec 2003 A1
20030225833 Pilat et al. Dec 2003 A1
20040002871 Geranio Jan 2004 A1
20040003283 Goodman et al. Jan 2004 A1
20040021584 Hartz et al. Feb 2004 A1
20040024846 Randall et al. Feb 2004 A1
20040030525 Robinson et al. Feb 2004 A1
20040030741 Wolton et al. Feb 2004 A1
20040039581 Wheeler Feb 2004 A1
20040054428 Sheha et al. Mar 2004 A1
20040056762 Rogers Mar 2004 A1
20040088177 Travis et al. May 2004 A1
20040109012 Kraus et al. Jun 2004 A1
20040111302 Falk et al. Jun 2004 A1
20040122570 Sonoyama et al. Jun 2004 A1
20040122693 Hatscher et al. Jun 2004 A1
20040128215 Florance et al. Jul 2004 A1
20040135805 Gottsacker et al. Jul 2004 A1
20040139034 Farmer Jul 2004 A1
20040139049 Hancock et al. Jul 2004 A1
20040145593 Berkner et al. Jul 2004 A1
20040146199 Berkner et al. Jul 2004 A1
20040148275 Achlioptas Jul 2004 A1
20040153466 Ziff et al. Aug 2004 A1
20040157648 Lightman Aug 2004 A1
20040158488 Johnson Aug 2004 A1
20040162064 Himmelstein Aug 2004 A1
20040166878 Erskine et al. Aug 2004 A1
20040167787 Lynch et al. Aug 2004 A1
20040172280 Fraki et al. Sep 2004 A1
20040186766 Fellenstein et al. Sep 2004 A1
20040210661 Thompson Oct 2004 A1
20040215517 Chen et al. Oct 2004 A1
20040215559 Rebenack et al. Oct 2004 A1
20040217884 Samadani et al. Nov 2004 A1
20040217980 Radburn et al. Nov 2004 A1
20040220903 Shah et al. Nov 2004 A1
20040220906 Gargi et al. Nov 2004 A1
20040230562 Wysoczanski et al. Nov 2004 A1
20040236771 Colver et al. Nov 2004 A1
20040243478 Walker et al. Dec 2004 A1
20040257340 Jawerth Dec 2004 A1
20040260604 Bedingfield Dec 2004 A1
20040260677 Malpani et al. Dec 2004 A1
20040267625 Feng et al. Dec 2004 A1
20050015488 Bayyapu Jan 2005 A1
20050018177 Rosenberg et al. Jan 2005 A1
20050021750 Abrams Jan 2005 A1
20050027723 Jones et al. Feb 2005 A1
20050034075 Riegelman et al. Feb 2005 A1
20050044061 Klemow Feb 2005 A1
20050049971 Bettinger Mar 2005 A1
20050055353 Marx et al. Mar 2005 A1
20050086309 Galli et al. Apr 2005 A1
20050091027 Zaher et al. Apr 2005 A1
20050091175 Farmer Apr 2005 A9
20050091209 Frank et al. Apr 2005 A1
20050094851 Bodin et al. May 2005 A1
20050096977 Rossides May 2005 A1
20050097319 Zhu et al. May 2005 A1
20050108520 Yamamoto et al. May 2005 A1
20050114527 Hankey et al. May 2005 A1
20050114759 Williams et al. May 2005 A1
20050114783 Szeto May 2005 A1
20050120084 Hu et al. Jun 2005 A1
20050131761 Trika et al. Jun 2005 A1
20050137015 Rogers et al. Jun 2005 A1
20050143174 Goldman et al. Jun 2005 A1
20050144065 Calabria et al. Jun 2005 A1
20050149432 Galey Jul 2005 A1
20050154639 Zetmeir Jul 2005 A1
20050159970 Buyukkokten et al. Jul 2005 A1
20050171799 Hull et al. Aug 2005 A1
20050171832 Hull et al. Aug 2005 A1
20050171954 Hull et al. Aug 2005 A1
20050171955 Hull et al. Aug 2005 A1
20050177385 Hull et al. Aug 2005 A1
20050187823 Howes Aug 2005 A1
20050192859 Mertins et al. Sep 2005 A1
20050192912 Bator et al. Sep 2005 A1
20050192999 Cook et al. Sep 2005 A1
20050193410 Eldering Sep 2005 A1
20050197775 Smith Sep 2005 A1
20050197846 Pezaris et al. Sep 2005 A1
20050197950 Moya et al. Sep 2005 A1
20050198020 Garland et al. Sep 2005 A1
20050198031 Pezaris et al. Sep 2005 A1
20050198305 Pezaris et al. Sep 2005 A1
20050203768 Florance et al. Sep 2005 A1
20050203769 Weild Sep 2005 A1
20050203807 Bezos et al. Sep 2005 A1
20050209776 Ogino et al. Sep 2005 A1
20050209781 Anderson Sep 2005 A1
20050216186 Dorfman et al. Sep 2005 A1
20050216300 Appelman et al. Sep 2005 A1
20050216550 Paseman et al. Sep 2005 A1
20050219044 Douglass et al. Oct 2005 A1
20050235062 Lunt et al. Oct 2005 A1
20050240580 Zamir et al. Oct 2005 A1
20050251331 Kreft Nov 2005 A1
20050256756 Lam et al. Nov 2005 A1
20050259648 Kodialam et al. Nov 2005 A1
20050270299 Rasmussen et al. Dec 2005 A1
20050273346 Frost Dec 2005 A1
20050283497 Nurminen et al. Dec 2005 A1
20050288957 Eraker et al. Dec 2005 A1
20050288958 Eraker et al. Dec 2005 A1
20050289650 Kalogridis Dec 2005 A1
20060004680 Robarts et al. Jan 2006 A1
20060004703 Spivack et al. Jan 2006 A1
20060004734 Malkin et al. Jan 2006 A1
20060022048 Johnson Feb 2006 A1
20060023881 Akiyama et al. Feb 2006 A1
20060025883 Reeves Feb 2006 A1
20060026147 Cone et al. Feb 2006 A1
20060036588 Frank et al. Feb 2006 A1
20060036748 Nusbaum et al. Feb 2006 A1
20060041543 Achlioptas Feb 2006 A1
20060042483 Work et al. Mar 2006 A1
20060047825 Steenstra et al. Mar 2006 A1
20060048059 Etkin Mar 2006 A1
20060052091 Onyon et al. Mar 2006 A1
20060058921 Okamoto Mar 2006 A1
20060058952 Cooper et al. Mar 2006 A1
20060059023 Mashinsky Mar 2006 A1
20060064431 Kishore et al. Mar 2006 A1
20060074780 Taylor et al. Apr 2006 A1
20060075335 Gloor Apr 2006 A1
20060080613 Savant Apr 2006 A1
20060085419 Rosen Apr 2006 A1
20060088145 Reed et al. Apr 2006 A1
20060089882 Shimansky Apr 2006 A1
20060100892 Ellanti May 2006 A1
20060113425 Rader Jun 2006 A1
20060123053 Scannell Jun 2006 A1
20060125616 Song Jun 2006 A1
20060136127 Coch et al. Jun 2006 A1
20060136419 Brydon et al. Jun 2006 A1
20060143066 Calabria Jun 2006 A1
20060143067 Calabria Jun 2006 A1
20060143083 Wedeen Jun 2006 A1
20060143183 Goldberg et al. Jun 2006 A1
20060149624 Baluja et al. Jul 2006 A1
20060161599 Rosen Jul 2006 A1
20060178972 Jung et al. Aug 2006 A1
20060184578 La Rotonda et al. Aug 2006 A1
20060184617 Nicholas et al. Aug 2006 A1
20060184997 La Rotonda et al. Aug 2006 A1
20060190279 Heflin Aug 2006 A1
20060190281 Kott et al. Aug 2006 A1
20060194186 Nanda Aug 2006 A1
20060200384 Arutunian et al. Sep 2006 A1
20060212407 Lyon Sep 2006 A1
20060217885 Crady et al. Sep 2006 A1
20060218225 Hee Voon et al. Sep 2006 A1
20060218226 Johnson et al. Sep 2006 A1
20060223518 Haney Oct 2006 A1
20060226281 Walton Oct 2006 A1
20060229063 Koch Oct 2006 A1
20060230061 Sample et al. Oct 2006 A1
20060238383 Kimchi et al. Oct 2006 A1
20060242139 Butterfield et al. Oct 2006 A1
20060242178 Butterfield et al. Oct 2006 A1
20060242581 Manion et al. Oct 2006 A1
20060247940 Zhu et al. Nov 2006 A1
20060248573 Pannu et al. Nov 2006 A1
20060251292 Gokturk et al. Nov 2006 A1
20060253491 Gokturk et al. Nov 2006 A1
20060256008 Rosenberg Nov 2006 A1
20060264209 Atkinson et al. Nov 2006 A1
20060265277 Yasinovsky et al. Nov 2006 A1
20060265417 Amato et al. Nov 2006 A1
20060270419 Crowley et al. Nov 2006 A1
20060270421 Phillips et al. Nov 2006 A1
20060271287 Gold et al. Nov 2006 A1
20060271472 Cagan Nov 2006 A1
20060293976 Nam Dec 2006 A1
20060294011 Smith Dec 2006 A1
20070002057 Danzig et al. Jan 2007 A1
20070003182 Hunn Jan 2007 A1
20070005683 Omidyar Jan 2007 A1
20070005750 Lunt et al. Jan 2007 A1
20070011148 Burkey et al. Jan 2007 A1
20070011617 Akagawa et al. Jan 2007 A1
20070016689 Birch Jan 2007 A1
20070027920 Alvarado et al. Feb 2007 A1
20070032942 Thota Feb 2007 A1
20070033064 Abrahamsohn Feb 2007 A1
20070033182 Knorr Feb 2007 A1
20070038646 Thota Feb 2007 A1
20070043947 Mizikovsky et al. Feb 2007 A1
20070050360 Hull et al. Mar 2007 A1
20070061128 Odom et al. Mar 2007 A1
20070061405 Keohane et al. Mar 2007 A1
20070067219 Altberg et al. Mar 2007 A1
20070078747 Baack Apr 2007 A1
20070078772 Dadd Apr 2007 A1
20070099609 Cai May 2007 A1
20070105536 Tingo May 2007 A1
20070106627 Srivastava et al. May 2007 A1
20070112461 Zini et al. May 2007 A1
20070112645 Traynor et al. May 2007 A1
20070112729 Wiseman et al. May 2007 A1
20070118430 Wiseman et al. May 2007 A1
20070118525 Svendsen May 2007 A1
20070150375 Yang Jun 2007 A1
20070150603 Crull et al. Jun 2007 A1
20070156429 Godar Jul 2007 A1
20070159651 Disario et al. Jul 2007 A1
20070162432 Armstrong et al. Jul 2007 A1
20070162458 Fasciano Jul 2007 A1
20070162547 Ross Jul 2007 A1
20070162942 Hamynen et al. Jul 2007 A1
20070167204 Lyle et al. Jul 2007 A1
20070168852 Erol et al. Jul 2007 A1
20070168888 Jawerth Jul 2007 A1
20070174389 Armstrong et al. Jul 2007 A1
20070179905 Buch et al. Aug 2007 A1
20070185906 Humphries et al. Aug 2007 A1
20070192299 Zuckerberg et al. Aug 2007 A1
20070203644 Thota et al. Aug 2007 A1
20070203820 Rashid Aug 2007 A1
20070207755 Julia et al. Sep 2007 A1
20070208613 Backer Sep 2007 A1
20070208802 Barman et al. Sep 2007 A1
20070208916 Tomita Sep 2007 A1
20070214141 Sittig et al. Sep 2007 A1
20070218900 Abhyanker Sep 2007 A1
20070219659 Abhyanker et al. Sep 2007 A1
20070219712 Abhyanker Sep 2007 A1
20070220174 Abhyanker Sep 2007 A1
20070226314 Eick et al. Sep 2007 A1
20070233291 Herde et al. Oct 2007 A1
20070233367 Chen et al. Oct 2007 A1
20070233375 Garg et al. Oct 2007 A1
20070233582 Abhyanker Oct 2007 A1
20070239352 Thota et al. Oct 2007 A1
20070239552 Sundaresan Oct 2007 A1
20070239648 Thota Oct 2007 A1
20070245002 Nguyen et al. Oct 2007 A1
20070250321 Balusu Oct 2007 A1
20070250511 Endler et al. Oct 2007 A1
20070255785 Hayashi et al. Nov 2007 A1
20070255831 Hayashi et al. Nov 2007 A1
20070258642 Thota Nov 2007 A1
20070259654 Oijer Nov 2007 A1
20070260599 McGuire et al. Nov 2007 A1
20070261071 Lunt et al. Nov 2007 A1
20070266003 Wong et al. Nov 2007 A1
20070266097 Harik et al. Nov 2007 A1
20070266118 Wilkins Nov 2007 A1
20070268310 Dolph et al. Nov 2007 A1
20070270163 Anupam et al. Nov 2007 A1
20070271367 Yardeni et al. Nov 2007 A1
20070273558 Smith et al. Nov 2007 A1
20070281689 Altman et al. Dec 2007 A1
20070281690 Altman et al. Dec 2007 A1
20070281716 Altman et al. Dec 2007 A1
20070282621 Altman et al. Dec 2007 A1
20070282987 Fischer et al. Dec 2007 A1
20070288164 Gordon et al. Dec 2007 A1
20070288311 Underhill Dec 2007 A1
20070288621 Gundu et al. Dec 2007 A1
20070294357 Antoine Dec 2007 A1
20080005076 Payne et al. Jan 2008 A1
20080005231 Kelley et al. Jan 2008 A1
20080010343 Escaffi et al. Jan 2008 A1
20080010365 Schneider Jan 2008 A1
20080016051 Schiller Jan 2008 A1
20080020814 Kernene Jan 2008 A1
20080032666 Hughes et al. Feb 2008 A1
20080032703 Krumm et al. Feb 2008 A1
20080033641 Medalia Feb 2008 A1
20080033652 Hensley et al. Feb 2008 A1
20080033739 Zuckerberg et al. Feb 2008 A1
20080033776 Marchese Feb 2008 A1
20080040370 Bosworth et al. Feb 2008 A1
20080040428 Wei et al. Feb 2008 A1
20080040474 Zuckerberg et al. Feb 2008 A1
20080040475 Bosworth et al. Feb 2008 A1
20080040673 Zuckerberg et al. Feb 2008 A1
20080043020 Snow et al. Feb 2008 A1
20080043037 Carroll Feb 2008 A1
20080046976 Zuckerberg Feb 2008 A1
20080048065 Kuntz Feb 2008 A1
20080051932 Jermyn et al. Feb 2008 A1
20080059992 Amidon et al. Mar 2008 A1
20080065321 DaCosta Mar 2008 A1
20080065611 Hepworth et al. Mar 2008 A1
20080070593 Altman et al. Mar 2008 A1
20080070697 Robinson et al. Mar 2008 A1
20080071929 Motte et al. Mar 2008 A1
20080077464 Gottlieb et al. Mar 2008 A1
20080077581 Drayer et al. Mar 2008 A1
20080077642 Carbone et al. Mar 2008 A1
20080077708 Scott et al. Mar 2008 A1
20080086368 Bauman et al. Apr 2008 A1
20080086458 Robinson et al. Apr 2008 A1
20080091461 Evans et al. Apr 2008 A1
20080091723 Zuckerberg et al. Apr 2008 A1
20080091786 Jhanji Apr 2008 A1
20080097999 Horan Apr 2008 A1
20080098090 Geraci et al. Apr 2008 A1
20080098313 Pollack Apr 2008 A1
20080103959 Carroll et al. May 2008 A1
20080104227 Birnie et al. May 2008 A1
20080109718 Narayanaswami May 2008 A1
20080115082 Simmons et al. May 2008 A1
20080115226 Welingkar et al. May 2008 A1
20080117928 Abhyanker May 2008 A1
20080125969 Chen et al. May 2008 A1
20080126355 Rowley May 2008 A1
20080126411 Zhuang et al. May 2008 A1
20080126476 Nicholas et al. May 2008 A1
20080126478 Ferguson et al. May 2008 A1
20080133495 Fischer Jun 2008 A1
20080133649 Pennington Jun 2008 A1
20080134035 Pennington et al. Jun 2008 A1
20080148156 Brewer et al. Jun 2008 A1
20080154733 Wolfe Jun 2008 A1
20080155019 Wallace et al. Jun 2008 A1
20080162027 Murphy et al. Jul 2008 A1
20080162211 Addington Jul 2008 A1
20080162260 Rohan et al. Jul 2008 A1
20080167771 Whittaker et al. Jul 2008 A1
20080168068 Hutheesing Jul 2008 A1
20080168175 Tran Jul 2008 A1
20080172173 Chang et al. Jul 2008 A1
20080172244 Coupal et al. Jul 2008 A1
20080172288 Pilskalns et al. Jul 2008 A1
20080189292 Stremel et al. Aug 2008 A1
20080189380 Bosworth et al. Aug 2008 A1
20080189768 Callahan et al. Aug 2008 A1
20080195483 Moore Aug 2008 A1
20080201156 Abhyanker Aug 2008 A1
20080208956 Spiridellis et al. Aug 2008 A1
20080208969 Van Riel Aug 2008 A1
20080215994 Harrison et al. Sep 2008 A1
20080221846 Aggarwal et al. Sep 2008 A1
20080221984 Abhyanker Sep 2008 A1
20080222140 Lagad et al. Sep 2008 A1
20080222308 Abhyanker Sep 2008 A1
20080228719 Abhyanker et al. Sep 2008 A1
20080228775 Abhyanker et al. Sep 2008 A1
20080229424 Harris et al. Sep 2008 A1
20080231630 Shenkar et al. Sep 2008 A1
20080238941 Kinnan et al. Oct 2008 A1
20080240397 Abhyanker Oct 2008 A1
20080242317 Abhyanker Oct 2008 A1
20080243378 Zavoli Oct 2008 A1
20080243598 Abhyanker Oct 2008 A1
20080243667 Lecomte Oct 2008 A1
20080243830 Abhyanker Oct 2008 A1
20080250025 Abhyanker Oct 2008 A1
20080255759 Abhyanker Oct 2008 A1
20080256230 Handley Oct 2008 A1
20080263460 Altberg et al. Oct 2008 A1
20080269992 Kawasaki Oct 2008 A1
20080270158 Abhyanker Oct 2008 A1
20080270366 Frank Oct 2008 A1
20080270615 Centola et al. Oct 2008 A1
20080270945 Abhyanker Oct 2008 A1
20080281854 Abhyanker Nov 2008 A1
20080288277 Fasciano Nov 2008 A1
20080288612 Kwon Nov 2008 A1
20080294678 Gorman et al. Nov 2008 A1
20080294747 Abhyanker Nov 2008 A1
20080300979 Abhyanker Dec 2008 A1
20080301565 Abhyanker Dec 2008 A1
20080306754 Abhyanker Dec 2008 A1
20080307053 Mitnick et al. Dec 2008 A1
20080307066 Amidon et al. Dec 2008 A1
20080307320 Payne et al. Dec 2008 A1
20080316021 Manz et al. Dec 2008 A1
20080319778 Abhyanker Dec 2008 A1
20080319806 Abhyanker Dec 2008 A1
20090003265 Agarwal et al. Jan 2009 A1
20090006177 Beaver et al. Jan 2009 A1
20090006473 Elliott et al. Jan 2009 A1
20090007195 Beyabani Jan 2009 A1
20090018850 Abhyanker Jan 2009 A1
20090018925 Abhyanker Jan 2009 A1
20090019004 Abhyanker Jan 2009 A1
20090019085 Abhyanker Jan 2009 A1
20090019122 Abhyanker Jan 2009 A1
20090019366 Abhyanker Jan 2009 A1
20090019373 Abhyanker Jan 2009 A1
20090024740 Abhyanker Jan 2009 A1
20090029672 Manz Jan 2009 A1
20090030927 Cases et al. Jan 2009 A1
20090031006 Johnson Jan 2009 A1
20090031245 Brezina et al. Jan 2009 A1
20090031301 D'Angelo et al. Jan 2009 A1
20090043650 Abhyanker et al. Feb 2009 A1
20090044254 Tian Feb 2009 A1
20090048922 Morgenstern et al. Feb 2009 A1
20090049018 Gross Feb 2009 A1
20090049037 Gross Feb 2009 A1
20090049070 Steinberg Feb 2009 A1
20090049127 Juan et al. Feb 2009 A1
20090061883 Abhyanker Mar 2009 A1
20090063252 Abhyanker Mar 2009 A1
20090063467 Abhyanker Mar 2009 A1
20090063500 Zhai et al. Mar 2009 A1
20090064011 Abhyanker Mar 2009 A1
20090064144 Abhyanker Mar 2009 A1
20090069034 Abhyanker Mar 2009 A1
20090070334 Callahan et al. Mar 2009 A1
20090070435 Abhyanker Mar 2009 A1
20090077100 Hancock et al. Mar 2009 A1
20090102644 Hayden Apr 2009 A1
20090119275 Chen et al. May 2009 A1
20090132504 Vegnaduzzo et al. May 2009 A1
20090132644 Frishert et al. May 2009 A1
20090171950 Lunenfeld Jul 2009 A1
20090177577 Garcia Jul 2009 A1
20090177628 Yanagisawa et al. Jul 2009 A1
20090228305 Gustafsson et al. Sep 2009 A1
20090254971 Herz et al. Oct 2009 A1
20090271417 Toebes et al. Oct 2009 A1
20090271524 Davi et al. Oct 2009 A1
20090282353 Halbherr et al. Nov 2009 A1
20090284530 Lester et al. Nov 2009 A1
20090287682 Fujioka et al. Nov 2009 A1
20090299551 So et al. Dec 2009 A1
20100011081 Crowley et al. Jan 2010 A1
20100023388 Blumberg et al. Jan 2010 A1
20100024045 Sastry et al. Jan 2010 A1
20100051740 Yoeli Mar 2010 A1
20100057555 Butterfield et al. Mar 2010 A1
20100064007 Randall Mar 2010 A1
20100070075 Chirnomas Mar 2010 A1
20100076966 Strutton et al. Mar 2010 A1
20100077316 Omansky et al. Mar 2010 A1
20100079338 Wooden et al. Apr 2010 A1
20100082683 Law et al. Apr 2010 A1
20100083125 Zafar et al. Apr 2010 A1
20100088015 Lee Apr 2010 A1
20100094548 Tadman et al. Apr 2010 A1
20100100937 Tran Apr 2010 A1
20100106731 Cartmell et al. Apr 2010 A1
20100108801 Olm et al. May 2010 A1
20100118025 Smith et al. May 2010 A1
20100120422 Cheung et al. May 2010 A1
20100138259 Delk Jun 2010 A1
20100138318 Chun Jun 2010 A1
20100191798 Seefeld et al. Jul 2010 A1
20100198684 Eraker et al. Aug 2010 A1
20100214250 Gillespie et al. Aug 2010 A1
20100231383 Levine et al. Sep 2010 A1
20100243794 Jermyn Sep 2010 A1
20100255899 Paulsen Oct 2010 A1
20100275033 Gillespie et al. Oct 2010 A1
20100306016 Solaro et al. Dec 2010 A1
20110001020 Forgac Jan 2011 A1
20110015954 Ward Jan 2011 A1
20110022540 Stern et al. Jan 2011 A1
20110040681 Ahroon Feb 2011 A1
20110040692 Ahroon Feb 2011 A1
20110041084 Karam Feb 2011 A1
20110061018 Piratla et al. Mar 2011 A1
20110066588 Xie et al. Mar 2011 A1
20110066648 Abhyanker et al. Mar 2011 A1
20110078012 Adamec Mar 2011 A1
20110078270 Galli et al. Mar 2011 A1
20110082747 Khan et al. Apr 2011 A1
20110087667 Hutheesing Apr 2011 A1
20110093340 Kramer et al. Apr 2011 A1
20110093498 Lunt et al. Apr 2011 A1
20110099142 Karjalainen et al. Apr 2011 A1
20110106658 Britt May 2011 A1
20110112976 Ryan et al. May 2011 A1
20110118907 Elkins May 2011 A1
20110128144 Baron, Sr. et al. Jun 2011 A1
20110131172 Herzog et al. Jun 2011 A1
20110151898 Chandra et al. Jun 2011 A1
20110163160 Zini et al. Jul 2011 A1
20110174920 Yoeli Jul 2011 A1
20110181470 Qiu et al. Jul 2011 A1
20110184643 Abhyanker Jul 2011 A1
20110202426 Cretney et al. Aug 2011 A1
20110219318 Abhyanker Sep 2011 A1
20110231268 Ungos Sep 2011 A1
20110246258 Cragun et al. Oct 2011 A1
20110256895 Palin et al. Oct 2011 A1
20110258028 Satyavolu et al. Oct 2011 A1
20110264692 Kardell Oct 2011 A1
20110291851 Whisenant Dec 2011 A1
20120023196 Grayson et al. Jan 2012 A1
20120047102 Petersen et al. Feb 2012 A1
20120047448 Amidon et al. Feb 2012 A1
20120077523 Roumeliotis et al. Mar 2012 A1
20120084289 Hutheesing Apr 2012 A1
20120096098 Balassanian Apr 2012 A1
20120123667 Guéziec May 2012 A1
20120126974 Phillips et al. May 2012 A1
20120138732 Olm et al. Jun 2012 A1
20120163206 Leung et al. Jun 2012 A1
20120166935 Abhyanker Jun 2012 A1
20120191606 Milne Jul 2012 A1
20120191797 Masonis et al. Jul 2012 A1
20120209775 Milne Aug 2012 A1
20120221470 Lyon Aug 2012 A1
20120224076 Niedermeyer et al. Sep 2012 A1
20120232958 Silbert Sep 2012 A1
20120239483 Yankovich et al. Sep 2012 A1
20120239520 Lee Sep 2012 A1
20120246024 Thomas et al. Sep 2012 A1
20120254774 Patton Oct 2012 A1
20120259688 Kim Oct 2012 A1
20120264447 Rieger, III Oct 2012 A1
20120270567 Johnson Oct 2012 A1
20120278743 Heckman et al. Nov 2012 A1
20120331002 Carrington Dec 2012 A1
20130005307 Kim et al. Jan 2013 A1
20130024108 Grün Jan 2013 A1
20130041761 Voda Feb 2013 A1
20130041862 Yang et al. Feb 2013 A1
20130054317 Abhyanker Feb 2013 A1
20130055163 Matas et al. Feb 2013 A1
20130068876 Radu Mar 2013 A1
20130072114 Abhyanker Mar 2013 A1
20130073375 Abhyanker Mar 2013 A1
20130073474 Young et al. Mar 2013 A1
20130080217 Abhyanker Mar 2013 A1
20130103437 Nelson Apr 2013 A1
20130105635 Alzu'bi et al. May 2013 A1
20130110631 Mitchell et al. May 2013 A1
20130151455 Odom et al. Jun 2013 A1
20130159127 Myslinski Jun 2013 A1
20130204437 Koselka et al. Aug 2013 A1
20130238170 Klinger Sep 2013 A1
20130254670 Eraker et al. Sep 2013 A1
20130282842 Blecon et al. Oct 2013 A1
20130297589 Work et al. Nov 2013 A1
20130301405 Fuste Vilella et al. Nov 2013 A1
20130303197 Chandra et al. Nov 2013 A1
20130317999 Zimberoff et al. Nov 2013 A1
20140032034 Raptopoulos et al. Jan 2014 A1
20140040179 Shai Herzog et al. Jan 2014 A1
20140067167 Levien et al. Mar 2014 A1
20140067704 Abhyanker Mar 2014 A1
20140074736 Carrington Mar 2014 A1
20140081450 Kuehnrich et al. Mar 2014 A1
20140087780 Abhyanker et al. Mar 2014 A1
20140095293 Abhyanker Apr 2014 A1
20140100900 Abhyanker Apr 2014 A1
20140108540 Crawford Apr 2014 A1
20140108556 Abhyanker Apr 2014 A1
20140108613 Randall Apr 2014 A1
20140114866 Abhyanker Apr 2014 A1
20140115671 Abhyanker Apr 2014 A1
20140123246 Abhyanker May 2014 A1
20140123247 Abhyanker May 2014 A1
20140130140 Abhyanker May 2014 A1
20140135039 Sartipi et al. May 2014 A1
20140136328 Abhyanker May 2014 A1
20140136414 Abhyanker May 2014 A1
20140136624 Abhyanker May 2014 A1
20140142848 Chen et al. May 2014 A1
20140143061 Abhyanker May 2014 A1
20140149244 Abhyanker May 2014 A1
20140149508 Middleton et al. May 2014 A1
20140164126 Nicholas et al. Jun 2014 A1
20140165091 Abhyanker Jun 2014 A1
20140172727 Abhyanker et al. Jun 2014 A1
20140204360 Dowski, Jr. et al. Jul 2014 A1
20140222908 Park et al. Aug 2014 A1
20140254896 Zhou et al. Sep 2014 A1
20140277834 Levien et al. Sep 2014 A1
20140316243 Niedermeyer Oct 2014 A1
Foreign Referenced Citations (26)
Number Date Country
1426876 Jun 2004 EP
101069834 Oct 2010 KR
1020120121376 Jul 2012 KR
9808055 Feb 1998 WO
9956143 Nov 1999 WO
0054170 Sep 2000 WO
01063423 Aug 2001 WO
0201455 Jan 2002 WO
0219236 Mar 2002 WO
0241115 May 2002 WO
03058540 Jul 2003 WO
2005103624 Nov 2005 WO
2006020471 Feb 2006 WO
2007108927 Sep 2007 WO
2007108928 Sep 2007 WO
2007113844 Oct 2007 WO
2008103149 Aug 2008 WO
2008105766 Sep 2008 WO
2008108772 Sep 2008 WO
2008118119 Oct 2008 WO
2008123851 Oct 2008 WO
2008111929 Nov 2008 WO
2009138559 Nov 2009 WO
2010103163 Sep 2010 WO
2013188762 Dec 2013 WO
2014121145 Aug 2014 WO
Non-Patent Literature Citations (80)
Entry
Benchmark-Backed Nextdoor Launches As a Private Social Network for Neighborhoods, Techcrunch Article, Oct. 26, 2011 by Leena Rao (6 Pages) http://techcrunch.com/2011/10/26/benchmark-backed-nextdoor-launches-as-a-private-social-network-for-neighborhoods/.
Fatdoor Founder Sues Benchmark Capital, Saying It Stole His Idea for Nextdoor, All Things Digital Article, Nov. 11, 2011, by Liz Gannes (7 Pages) http://allthingsd.com/20111111/fatdoor-founder-sues-benchmark-capital-saying-it-sole-his-idea-for-nextdoor/.
Fatdoor CEO Talks About Balancing Security with Community, Wired Magazine, May 31, 2007, by Terrence Russell (2 Pages) http://www.wired.com/2007/05/fatdoor—ceo—tal/.
Fatdoor Launches Social Network for Your Neighborhood, Mashable Article, May 28, 2007, by Kristen Nicole (3 Pages) http://mashable.com/2007/05/28/fatdoor/.
Screenshots of Nextdoor website and its features—as submitted in Case5:14-cv-02335-BLF on Jul. 15, 2014 (pp. 19) http://www.nextdoor.com/.
Fatdoor turns neighborhoods into online social networks, VentureBeat News Article, May 28, 2007, by Dan Kaplan (pp. 4) http://venturebeat.com/2007/05/28/fatdoor-turns-neighborhoods-into-online-social-networks/.
Halloween Just Got Easier: Nextdoor Debuts Halloween Treat Map, Nextdoor Blog, Oct. 17, 2013, by Anne Dreshfield (pp. 6) http://blog.nextdoor.com/2013/10/17/halloween-just-got-easier-nextdoor-debuts-halloween-treat-map/.
Helping Neighbors Connect, Screenshot from FrontPorchForum website—screenshots of Aug. 21, 2014 (3 Pages) http://frontporchforum.com/.
Advocacy Strategy for the Age of Connectivity, Netcentric Advocacy: fatdoor.com (alpha), Jun. 23, 2007 (p. 1) http://www.network-centricadvocacy.net/2007/06/fatdoorcom-alph.html.
Silicon Valley venture capital and legal globalization Blog, WayBack Machine Blogs Apr. 8, 2008, by Raj V. Abhyanker (pp. 2) https://web.archive.org/web/20080706001509/http:/abhyanker.blogspot.com/.
Frontporchforum. screenshots. Jul. 19, 2006 webarchive.org 1-15 (herein FrontPorch) (pp. 15).
Fatdoor where 2.0 Launch Coverage Report, Jun. 21, 2007, by Sterling Communications (pp. 24).
Screenshot of Fatdoor on Wikipedia, Apr. 12, 2007 (p. 1).
Case No. 5-14-cv-02335-BLF Complaint Fatdoor v. Nextdoor, Northern District of California, with Exhibits A, B and C {Part 1 (pp. 258)} and Exhibits D, E, F, G and H {Part 2 (pp. 222)}, Jul. 15, 2014.
Expert Report—Forensics of Jon Berryhill, Report, Nextdoor v. Abhyanker, Aug. 8, 2014, by Berryhill Computer forensics Inc. (pp. 23).
Case No. 3:12-cv-05667-EMC Complaint Nextdoor v. Abhyanker, Northern District of California, Nov. 5, 2012 (pp. 46).
Expert Report—Patent of Jeffrey G. Sheldon, Nextdoor v. Abhyanker, Aug. 8, 2014 (pp. 7).
Exhibits of Expert Report—Patent of Jeffrey G. Sheldon, Nextdoor v. Abhyanker, with Attachments A, B, C, D and E (1/2) {Part 1 (pp. 46)} and Attachments E (2/2) and F {Part 2 (pp. 41)}.
Case No. 111-CV-212924 Abhyanker v. Benchmark Capital Partners L.P., Superior Court of California, County of Santa Clara, Nov. 10, 2011 (pp. 78) http://www.scribd.com/doc/72441873/Stamped-COMPLAINT-Abhyanker-v-Benchmark-Capital-Et-Al-FILED-PUBLIC.
Neighbors Stop Diaper and Formula Thief in his Tracks, Nextdoor Blog, Aug. 15, 2014, by Anne Dreshfield (pp. 12) http://blog.nextdoor.com/.
Screenshot of Fatdoor website with its features—Aug. 21, 2014 (pp. 6) http://www.fatdoor.com/.
Screenshot of AirBnB website with its features—Aug. 21, 2014 (pp. 4) http://www.airbnb.com/.
Wikipedia entry AirBnB website—Aug. 21, 2014 (pp. 16) http://en.wikipedia.org/wiki/Airbnb.
AirBed&Breakfast for Connecting '07—Oct. 10, 2007 (1 Page) http://www.core77.com/blog/events/airbed—breakfast—for—connecting—07—7715.asp.
Case No. 5:14-cv-03844-PSG, Complaint Fatdoor, Inc. v. IP Analytics LLC and Google Inc.,Northern District of California, Aug. 25, 2014, (pp. 16).
Screenshot of Meetey on Crunch Base, Aug. 27, 2014, (pp. 3) http://www.crunchbase.com/organization/meetey.
Wikipedia entry Patch Media website—Aug. 27, 2014 (pp. 2) http://en.wikipedia.org/wiki/Patch—Media.
Wikipedia entry Yahoo! Groups website—Aug. 27, 2014 (pp. 7) http://en.wikipedia.org/wiki/Yahoo—groups.
Palo Alto News on Topix, Aug. 27, 2014, (pp. 3) http://www.topix.com/palo-alto.
Screenshot of My Neighbourhoods on Crunch Base, Aug. 27, 2014 (pp. 2) http://www.crunchbase.com/organization/my-neighbourhoods.
Screenshot of Dehood website, Aug. 27, 2014, (p. 1) http://www.dehood.com/home.
Wikipedia entry the Freecycle Network website—Aug. 27, 2014 (pp. 3) http://en.wikipedia.org/wiki/The—Freecycle—Network.
eDirectree Brings Group Wiki Twist to Social Networking, Techcrunch Article, Feb. 1, 2008 by Mark Hendrickson, (pp. 2) http://techcrunch.com/2008/02/01/edirectree-brings-group-wiki-twist-to-social-networking/.
Wikipedia entry Meetup website—Aug. 27, 2014 (p. 1) http://en.wikipedia.org/wiki/Meetup—(website).
Wikipedia entry Google Maps website—Aug. 27, 2014 (p. 18) http://en.wikipedia.org/wiki/Google—Maps.
Screenshot of Facebook website for groups, Aug. 27, 2014, (p. 1) https://www.facebook.com/about/groups.
Facebook Engineers bring Google+ Circles to Facebook, Article on ZDNet by Emil Protalinski, Jul. 3, 2011, (pp. 2) http://www.zdnet.com/blog/facebook/facebook-engineers-bring-google-circles-to-facebook/1885.
Screenshots of Uber website, Aug. 27, 2014, (pp. 5) https://www.uber.com/.
Screenshot of Lyft website, Aug. 27, 2014, (pp. 5) https://www.lyft.com/.
Wikipedia entry Google driverless car—Aug. 27, 2014 (pp. 4) http://en.wikipedia.org/wiki/Google—driverless—car.
Wikipedia entry Uber (company)—Aug. 27, 2014 (pp. 7) http://en.wikipedia.org/wiki/Uber—(company).
Wikipedia entry Autonomous car—Aug. 27, 2014 (pp. 15) http://en.wikipedia.org/wiki/Autonomous—car.
Screenshot of sidecar website, Aug. 27, 2014 (p. 1) http://www.sidecar.com/.
Screenshot of patch media website, Aug. 27, 2014 (pp. 6) http://patch.com/.
Screenshot of i-neighbors website, Aug. 27, 2014 (pp. 3) https://www.i-neighbors.org/howitworks.php.
http://www.zdnet.com/news/perspective-social-networking-for-all/149441.
http://www.remax.com/advancedsearch/.
http://global.remax.com/AdvancedListingSearch.aspx.
http://www.magicbricks.com/property-requirement-to-buy-rent/residential-commercial.
http://www.mapmyindia.com/solutions/tracking-lbs/vehicle-tracking.
http://www.mapmyindia.com/solutions/tracking-lbs/asset-tracking.
http://www.mapmyindia.com/solutions/enterprises/geo-tagging.
http://www.zillow.com/.
http://www.zillow.com/homes/for—rent/.
http://www.zillow.com/homes/for—sale/days—sort/53.409532,-64.072266,19.352611,-129.550781—rect/3—zm/.
http://www.trulia.com/home—prices/.
http://www.trulia.com/for—rent/New—York, NY.
http://www.realtor.com/rentals.
http://www.realtor.com/realestateforsale.
http://www.househunt.com/.
http://www.coldwellbanker.com/real—estate—search;jsessionid=S8ok3kaZtBh5GKHoo-Yzo28Z.sky-node04.
http://www.switchboard.com/.
http://www.anywho.com/whitepages.
http://wp.superpages.com/.
http://www.whitepages.com/.
http://www-personal.umich.edu/˜ladamic/papers/socialsearch/adamicsocialsearch.pdf.
http://cs.wellesley.edu/˜cs315/315—PPTs/L19-SocialNetworks/Stuff/wellesley.pdf.
http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.98.5230&rep=rep1&type=pdf.
http://www.ece.lsu.edu/xinli/Research/HeatMap—TVCG06.pdf.
http://www.usa-people-search.com/.
https://www.i-neighbors.org/.
“Friends and Neighbors on the Web”, 2001 by Lada A. Adamic et al. (pp. 9) http://www.hpl.hp.com/research/idl/papers/web10/fnn2.pdf.
“A social influence model of consumer participation in network- and small-group-based virtual communities”, International Journal of Research in Marketing, 2004 by Utpal M, Dholakia et al. (pp. 23) http://www-bcf.usc.edu/˜douglast/620/bettina1.pdf.
“BuzzMaps: a prototype social proxy for predictive utility”, ACM Digital Library, 2003 by Azzari Caillier Jarrett et al. (Pages) http://dl.acm.org/citation.cfm?id=948547&dl=ACM&coll=DL&CFID=456946313&CFTOKEN=50139062.
“Direct Annotation: A Drag-and-Drop Strategy for Labeling Photos”, University of Maryland, 2000 by Ben Shneiderman et al. (pp. 8) http://hcil2.cs.umd.edu/trs/2000-06/2000-06.pdf.
“Notification for Shared Annotation of Digital Documents”, Technical Report MSR—TR-2001-87, Sep. 19, 2001 by A. J. Bernheim Brush et al. (pp. 9) http://research.microsoft.com/pubs/69880/tr-2001-87.pdf.
“HT06, Tagging Paper, Taxonomy, Flickr, Academic Article, ToRead”, Yahoo Research Berkeley, CA, 2006 by Cameron Marlow et al. (pp. 9) http://www.danah.org/papers/Hypertext2006.pdf.
“Computer Systems and the Design of Organizational Interaction”, by Fernando Flores et al. (pp. 20) http://cpe.njit.edu/dlnotes/CIS/CIS735/ComputerSystemsandDesign.pdf.
“ChipIn—the easy way to collect money”, Louis' Really Useful Finds, Mar. 12. (p. 1) http://reallyusefulthings.tumblr.com/post/28688782/chipin-the-easy-way-to-collect-money.
“Crowdsourcing: Those that are willing to test & learn will be those that will win”, Newsline, Mar. 1, 2011by Neil Perkin http://mediatel.co.uk/newsline/2011/03/01/crowdsourcing-those-that-are-willing-to-test-learn-will-be-those-that-will-win/.
Related Publications (1)
Number Date Country
20160021178 A1 Jan 2016 US