Train based community

Information

  • Patent Grant
  • 9971985
  • Patent Number
    9,971,985
  • Date Filed
    Friday, June 20, 2014
    10 years ago
  • Date Issued
    Tuesday, May 15, 2018
    6 years ago
  • Inventors
    • Abhyanker; Raj (Cupertino, CA, US)
  • Examiners
    • Tran; Khoi H
    • Alsomiri; Majdi
    Agents
    • Raj Abhyanker, P.C.
Abstract
Disclosed are a method and a system of a train based community, according to one embodiment. In one embodiment, a method includes forming a train track adjacent to a set of homes in a residential community, placing a boarding location in a property boundary of each one of the set of homes in the residential community, and routing the train track to a merchant in the residential community. A shopping cart is autonomously routed from at least one boarding location of the property boundary to the merchant based on a request of an occupier of a home associated with the property boundary.
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 a train based community.


BACKGROUND

Residents of a residential community may have a number of errands that they must complete on a given day. These errands may force residents to spend time and/or traveling moving to and/or from merchants and/or transporting goods (e.g., groceries, clothing, and/or household products). As a result, roads may be congested by vehicles transporting goods and/or time may be wasted as residents travel to and/or from merchant locations in order to transport items to and/or from their home and/or work.


SUMMARY

A method, device and system of a train based community are disclosed. In one aspect, a method includes forming a train track adjacent to a set of homes in a residential community, placing a boarding location in a property boundary of each one of the set of homes in the residential community, and routing the train track to a merchant in the residential community. A shopping cart is autonomously routed from at least one boarding location of the property boundary to the merchant based on a request of an occupier of a home associated with the property boundary.


It may be determine that the shopping cart is placed on an autonomous platform associated with the occupier of the home associated with the property boundary. The shopping cart may be autonomously routed to the merchant when the shopping cart is placed on the autonomous platform. It may be determined that the autonomous platform with the shopping cart is sharing the train track with other autonomous platforms each with shopping carts of other occupiers of other homes in the residential community.


The autonomous platform and/or the shopping cart may be permitted to communicate with at least one of neighboring autonomous platforms and neighboring shopping carts through a centralized server (through a wide area network) and/or a local area network formed between adjacent ones of the autonomous platform and/or the shopping cart and/or neighboring autonomous platforms and/or neighboring shopping carts. The centralized server may include an electronic commerce algorithm through which each occupier of each home of the residential community place an order to purchase an item of the merchant through a neighborhood social network. The autonomous platforms associated with each occupier may be communicatively directed to the merchant and/or other neighbors of the residential community when the shopping cart is placed on the autonomous platform associated with each occupant based on a request of a particular occupier in control of a particular autonomous platform.


A message may be automatically communicated to the merchant when the particular occupier places the order to purchase the item of the merchant. The message may include a description of the item, a location of the item, an identification of the particular occupier, a serial number of the particular autonomous platform, and/or a unique identifier of a particular shopping cart associated with the particular autonomous platform. The shopping cart may arrive in an interior space of a particular home associated with the particular occupier through a gate through which the particular autonomous platform associated with the particular shopping cart is transportable. The boarding location may be located in the interior space of the home.


The particular autonomous platform and/or the particular shopping cart includes a light assembly such that the at least one of the particular autonomous platform and the particular shopping cart automatically provides lighting in when an ambient lighting level dips below a threshold value. A building of the merchant may include a product picker in a warehouse area of the merchant at which the item is loaded when the message is received. The particular autonomous platform and/or the particular shopping cart may detect an obstacle when on a route between the particular home and the merchant. The obstacle may be a street, a pedestrian, and/or an object on the train track impeding progress of the particular autonomous platform and/or the particular shopping cart.


Multiple different types of assemblies (e.g., a box assembly, a carrier assembly, a locker assembly, and/or a person transporter rover assembly) may be attachable to the particular autonomous platform. The shopping cart may be personal to the occupier. The residential community may be a master planned community.


In another aspect, a method includes forming a train track adjacent to a set of homes in a residential community, placing a boarding location in a property boundary of each one of the set of homes in the residential community, routing the train track to a merchant in the residential community, and determining that a shopping cart is placed on an autonomous platform associated with an occupier of a home associated with the property boundary. The shopping cart may be autonomously routed to the merchant when the shopping cart is placed on the autonomous platform.


The shopping cart may be autonomously routed from at least one boarding location of the property boundary to the merchant based on a request of the occupier of the home associated with the property boundary. It may be determined that the autonomous platform with the shopping cart is sharing the train track with other autonomous platforms each with shopping carts of other occupiers of other homes in the residential community. The autonomous platform and/or the shopping cart may be permitted to communicate with at least one of neighboring autonomous platforms and neighboring shopping carts through a centralized server (through a wide area network) and/or a local area network formed between adjacent ones of the autonomous platform and/or the shopping cart and neighboring autonomous platforms and/or neighboring shopping carts.


The centralized server may include an electronic commerce algorithm through which each occupier of each home of the residential community to place an order to purchase an item of the merchant through a neighborhood social network. The autonomous platforms associated with each occupier are communicatively directed to at least one of the merchant and other neighbors of the residential community when the shopping cart is placed on the autonomous platform associated with each occupant based on a request of a particular occupier in control of a particular autonomous platform. A message may be automatically communicated to the merchant when the particular occupier places the order to purchase the item of the merchant.


The message may include a description of the item, a location of the item, an identification of the particular occupier, a serial number of the particular boarding location, and/or a unique identifier of a particular shopping cart associated with the particular autonomous platform. The shopping cart may arrive in an interior space of a particular home associated with the particular occupier through a gate through which the particular autonomous platform associated with the particular shopping cart is transportable. The boarding location may be located in the interior space of the home.


The particular autonomous platform and/or the particular shopping cart may include a light assembly such that the particular autonomous platform and/or the particular shopping cart automatically provides lighting in when an ambient lighting level dips below a threshold value. A building of the merchant may include a product picker in a warehouse area of the merchant at which the item is loaded when the message is received. The particular autonomous platform and/or the particular shopping cart may detect an obstacle when on a route between the particular home and the merchant.


The obstacle may be a street, a pedestrian, and/or an object on the train track impeding progress of the particular autonomous platform and/or the particular shopping cart. Multiple different types of assemblies may be attachable to the particular autonomous platform. The multiple assemblies may include a box assembly, a carrier assembly, a locker assembly, and/or a person transporter rover assembly. The shopping cart may be personal to the occupier he residential community may be a master planned community.


In yet another aspect, a residential community includes a train track formed adjacent to a set of homes in a residential community and routed to a merchant in the residential community. A boarding location is placed in a property boundary of each one of the set of homes in the residential community. The residential community also includes a shopping cart to autonomously route from at least one boarding location of the property boundary to the merchant based on a request of an occupier of a home associated with the property boundary.


A placement algorithm may determine that the shopping cart is placed on an autonomous platform associated with the occupier of the home associated with the property boundary. A routing algorithm may autonomously route the shopping cart to the merchant when the shopping cart is placed on the autonomous platform. A sharing algorithm may determine that the autonomous platform with the shopping cart is sharing the train track with other autonomous platforms each with shopping carts of other occupiers of other homes in the residential community.


A communication algorithm may permit the autonomous platform and/or the shopping cart to communicate with neighboring autonomous platforms and/or neighboring shopping carts through a centralized server (through a wide area network) and/or a local area network formed between adjacent ones of the autonomous platform and/or the shopping cart and neighboring autonomous platforms and/or neighboring shopping carts. An electronic commerce algorithm may enable each occupier of each home of the residential community to place an order to purchase an item of the merchant through a neighborhood social network. A direction algorithm to communicatively direct the shopping cart associated with each occupier to at least one of the merchant and other neighbors of the residential community when the shopping cart is placed on the boarding location associated with each occupant based on a request of a particular occupier in control of a particular autonomous platform.


A message algorithm may automatically communicate a message to the merchant when the particular occupier places the order to purchase the item of the merchant. The message may include a description of the item, a location of the item, an identification of the particular occupier, a serial number of the particular autonomous platform, and/or a unique identifier of a particular shopping cart associated with the particular autonomous platform. The shopping cart may arrive in an interior space of a particular home associated with the particular occupier through a gate through which the particular autonomous platform associated with the particular shopping cart is transportable. The boarding location may be located in the interior space of the home.


The particular autonomous platform and/or the particular shopping cart may include a light assembly such that the particular autonomous platform and/or the particular shopping cart automatically provides lighting in when an ambient lighting level dips below a threshold value. A building of the merchant may include a product picker in a warehouse area of the merchant at which the item is loaded when the message is received.


The particular autonomous platform and/or the particular shopping cart may detect an obstacle when on a route between the particular home and the merchant. The obstacle may be a street, a pedestrian, and/or an object on the train track impeding progress of the particular autonomous platform and/or the particular shopping cart. Multiple different types of assemblies (e.g., a box assembly, a carrier assembly, a locker assembly, and/or a person transporter rover assembly) may be attachable to the particular autonomous platform. The shopping cart may be personal to the occupier. The residential community may be a master planned community.


The methods, systems, and apparatuses 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 showing a centralized server routing a shopping cart to a merchant in a residential community based on a request of an occupier of a home in the residential community, according to one embodiment.



FIG. 2 is an exploded view of the centralized server of FIG. 1, according to one embodiment.



FIG. 3 is a table view illustrating data relationships between the occupier, the request, and the shopping cart, according to one embodiment.



FIG. 4 is a message view showing a processing device of the merchant of FIG. 1 receiving a message, according to one embodiment.



FIG. 5 is an alert view of a data processing system of the occupier of FIG. 1 receiving an alert notifying the occupier that the shopping cart has detected an obstacle, according to one embodiment.



FIG. 6 is an interior view of a boarding location in an interior space of the home of the occupier of FIG. 1, according to one embodiment.



FIG. 7 is a warehouse view of a product picker loading items into a shopping cart, according to one embodiment.



FIG. 8 is a critical path view illustrating a flow based on time in which critical operations in delivering a requested item by autonomously routing a shopping cart on a train track in a residential community, according to one embodiment.



FIG. 9 is a process flow of autonomously routing a shopping cart on a train track in a residential community based on the request of the occupier of a home in the residential community of FIG. 1, 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 a mapping search engine offering sidewalk maps, according to one embodiment.



FIG. 1 is a network view 150 showing a centralized server routing a shopping cart to a merchant in a residential community based on a request of an occupier of a home in the residential community, according to one embodiment. In particular, FIG. 1 shows a centralized server 100, a network 101, a processor 102, a memory 104, a database 106, a residential community 108, an occupier 110, a property boundary 112, a home 114, a request 116, a set of instructions 118, an autonomous platform 119, a shopping cart 120, a unique identifier 122, a message 124, a merchant 126, a boarding location 128, a set of homes 130, and a train track 132.


The residential community 108 may be a master planned community designed around the train track 132. In one embodiment, the set of homes 130 (e.g., residential houses and/or apartments), schools, buildings 702 (e.g., government buildings, hotels, and/or public buildings), parks, emergency services (e.g., police stations, hospitals, and/or fire departments) and/or merchants 126 (e.g., commercial entities, stores, and/or shops) in the residential community 108 may be built, located, and/or designed to be accessible by the train track 132. The train track 132 may be designed in such a way that any number of the set of homes 130, buildings 702, parks, emergency services, and/or merchants 126 are accessible by the train track 132.


In one embodiment, every occupier 110 (e.g., person that lives and/or works in the residential community 108) and/or non-transitory location (e.g., home 114, building 702, park, emergency service, and/or merchant 126) may have an associated (e.g., uniquely associated) autonomous platform 119, shopping cart 120 and/or boarding location 128. The boarding location 128 may be in the property boundary 112 associated with the non-transitory location (e.g., the home 114 associated with the occupier 110 and/or a building 702 associated with the merchant 126). In one embodiment, the property boundary 112 may be determined by the user and/or occupiers 110 of the residential community 108. The property boundary 112 may be determined entirely or in part by a data provider (e.g., Zillow.com, a white pages service, a government entity, official records, a deed, and/or a lease) and/or a vote (e.g., a vote by occupiers 110 and/or merchants 126 in the residential community 108). The property boundary 112 may be the legal boundary of the property (e.g., the home 114 and/or the building 702 associated with the merchant 126).


In one embodiment, each of the shopping carts 120 may be coupled with the train track 132 such that the shopping cart 120 is permanently affixed with the track and/or the boarding location 128. The shopping cart 120 may be coupled with the autonomous platform 119 which may be coupled with the train track 132. The shopping cart 120 and/or the autonomous platform 119 may be capable of being removed from the train track 132. In one embodiment, the boarding location 128 may be on the train track 132 and/or a section of the train track. The boarding location 128 may be separate from the train track 132 and/or positioned so that the shopping cart 120 may autonomously reach the boarding location 128 from the train track 132.


Each of the shopping carts 120, autonomous platforms 119, and/or boarding locations 128 may be communicatively coupled with the centralized server 100 through the network 101. The centralized server 100 may include the processor 102, the memory 104, and/or the database 106. The centralized server 100 may be one or more server side data processing system (e.g., web servers operating in concert with each other) that operate in a manner that provide a set of instructions 118 to any number of client side devices (e.g., a mobile device and/or a computing device) communicatively coupled with the centralized server 100 through the network 101. For example, the centralized server 100 may be a computing system (e.g., or a group of computing systems) that operates in a larger client-server database framework (e.g., such as in a social networking software such as Nextdoor.com, Fatdoor.com, Facebook.com, etc.).



FIG. 1 illustrates a number of operations between the centralized server 100, the occupier 110, shopping cart 120, and the merchant 126. Particularly, circle ‘1’ of FIG. 1 illustrates the request 116 being communicated from the occupier 110 of the home 114 in the residential community 108, through the network 101 (e.g., an Internet protocol network and/or a wide area network), to the centralized server 100. The request 116 may be an order 402 and/or a set of instructions 118 communicated by a data processing system 400 of the occupier 110. The data processing system 400 (e.g., a smartphone, a tablet, a laptop, a desktop computer, and/or a mobile device) may communicate the request 116 through a network (e.g., the network 101 and/or a cellular network) using a browser application of the data processing system 400 (e.g., Google®, Chrome) and/or through a client-side application downloaded to the data processing system 400 (e.g., a Nextdoor.com mobile application, a Fatdoor.com mobile application). The occupier 110 may be able to communicate the request 116 from any location. The request 116 may be sent from the data processing system 400 associated with the occupier 110, through the network 101, to the centralized server 100.


Circle ‘2’ shows the set of instructions 118 being communicated by the centralized server 100 to the autonomous platform 119 having the shopping cart 120 placed on it. The set of instructions 118 may be generated, using the processor 102 and the memory 104, based on the request 116 communicated by the occupier 110. The set of instructions 118 may route the autonomous platform 119 and/or the shopping cart 120 along the train track 132 to at least one destination (e.g., the boarding location 128 associated with the merchant 126). The set of instructions 118 may calibrate an assembly (e.g., a box assembly, a carrier assembly 606, a locker assembly, the shopping cart 120, and/or a person transporter rover assembly) placed on the autonomous platform 119. In one embodiment, the set of instructions 118 may set an interior of the assembly to a particular temperature and/or humidity, may calibrate a weight sensor (e.g., to determine the weight of contents placed in the assembly), and/or may set preferences of the shopping cart 120, the autonomous platform 119, and/or boarding location 128 (e.g., a lock combination and/or unlocking means, speed and/or threshold ambient lighting level). The set of instructions 118 may be communicated to the autonomous platform 119. In one embodiment, the autonomous platform 119 may route the shopping cart 120 to the destination (e.g., the boarding location 128 associated with the merchant 126).


The occupier 110 may receive a confirmation message 124 on the data processing system 400 used to communicate the request 116. The centralized server 100 may simultaneously communicate a message 124 through the network 101 to the merchant 126. The message 124 may include an order 402, an estimated time of arrival of the shopping cart 120, a message 124 from the occupier 110, and/or a set of instructions 118.



FIG. 2 is an exploded view 250 of the centralized server 100 of FIG. 1, according to one embodiment. FIG. 2 shows a placement algorithm 200, a routing algorithm 202, a sharing algorithm 204, a communication algorithm 206, an electronic commerce algorithm 208, a coupling algorithm 210, and a message algorithm 212.


The placement algorithm 200 may determine that the shopping cart 120 (e.g., the assembly) is placed on the autonomous platform 119 associated with the occupier 110 of the home 114 associated with the property boundary 112. The placement algorithm 200 may use a sensor (e.g., a weight sensor) on the autonomous platform 119 and/or the shopping cart 120 and/or the geo-spatial location of the shopping cart 120 to determine if the shopping cart 120 is located on the autonomous platform 119. The placement algorithm 200 may determine which autonomous platform 119 the shopping cart 120 is placed on.


The routing algorithm 202 may autonomously route 506 the shopping cart 120 to the merchant 126 when the shopping cart 120 is placed on the autonomous platform 119. The routing algorithm 202 may route the shopping cart 120 upon receipt of the request 116 and/or generation of the set of instructions 118. In one embodiment, the routing algorithm 202 may generate and/or aid in generating the set of instructions 118 which route 506 the shopping cart 120 to the boarding location 128 of the merchant 126. The autonomous platform 119 may automatically route 506 the shopping cart 120 upon receipt of the set of instructions 118 and/or may route the shopping cart 120 in accordance with the set of instructions 118.


The sharing algorithm 204 may determine that the autonomous platform 119 with the shopping cart 120 is sharing the train track 132 with other autonomous platform 119 each with shopping carts 120 of other occupiers 110 of other homes 114 in the residential community 108. The communication algorithm 206 may permit the autonomous platform 119 and/or the shopping cart 120 to communicate with neighboring boarding locations 128 and/or neighboring shopping carts 120 through the centralized server 100 (e.g., through a wide area network (e.g., the network 101)) and/or a local area network. The local area network may be formed between adjacent ones of the autonomous platform 119 and/or the shopping cart 120 and/or neighboring autonomous platform 119 and/or neighboring shopping carts 120. In one embodiment, shopping carts 120 may not be unique to occupiers 110 and/or may work in concert to maximize efficiency of route 506s and/or tasks. The communication algorithm 206 may enable shopping carts 120 and/or autonomous platforms 119 to communicate to determine optimal routes and/or enable a particular shopping cart 120 to complete a set of requests for different occupiers (e.g., in the scenario in which it is most efficient for the particular shopping cart 120 to complete the set of requests).


The electronic commerce algorithm 208 may enable each occupier 110 of each home 114 of the residential community 108 to place an order 402 to purchase an item 404 of the merchant 126 through a neighborhood social network. The social network may be a neighborhood social network (e.g., Fatdoor.com and/or Netdoor.com). Users of the social network (e.g., the occupiers 110) may be able to claim their residential and/or public (e.g., work) location in the residential community 108 (e.g., neighborhood). The occupier 110 may be able to place the order 402 in the form of the request 116 made to the centralized server 100 associated with the neighborhood social network.


The direction algorithm may communicatively direct the shopping cart 120 associated with each occupier 110 (e.g., the occupier 110, each occupier of the home 114 associated with the shopping cart 120, and/or each occupier 110 in the residential community 108) to the merchant 126 and/or other neighbors (e.g., occupiers 110) in the residential community 108 when the shopping cart 120 is placed on the autonomous platform 119 associated with each occupant based on the request 116 of the particular occupier 110 in control of a particular autonomous platform 119. The direction algorithm may communicatively direct the shopping cart 120 based on the set of instructions 118 generated based on the request 116 of the occupier 110. In one embodiment, occupiers 110 and/or merchants 126 may be able to prevent certain shopping carts 120 from being directed to certain boarding locations 128. For example, a particular merchant 126 may be able to block a particular occupier 110 (e.g., prevent the shopping cart 120 associated with the occupier 110 from being directed to the boarding location 128 associated with the merchant 126).


The message algorithm 212 may automatically communicate a message 124 (e.g., the message 124 of FIG. 1) to the merchant 126 when the particular occupier 110 places the order 402 to purchase the item 404 of the merchant 126. In one embodiment, the message 124 may include detail about the occupier 110 that sent the order 402 (e.g., in the form of the request 116), the boarding location 128 associated with the occupier 110, the autonomous platform 119 associated with the occupier 110 and/or the shopping cart 120 associated with the occupier 110 and/or the boarding location 128. The message 124 may include information about the request 116, the order 402, a set of instructions 118, a voice and/or textual message 124 from the occupier 110, a desired time of delivery, an estimated time of arrival, and/or a payment means (e.g., credit card information of the occupier 110).



FIG. 3 is a table view 350 illustrating data relationships between the occupier 110, the request 116, and the shopping cart 120, according to one embodiment. In one embodiment, the occupier 110 may be associated with the home 114, request 116, boarding location 128, and/or shopping cart 120. A status of the shopping cart 304 may be an operational status of the shopping cart 304 and/or a task status of the shopping cart 304. The occupier 110 may have a home 114 boarding location 128 (e.g., the boarding location 128 associated with the verified address of the occupant on the neighborhood social network) and/or a public boarding location 128 (e.g., a work boarding location 128 in the property boundary 112 of the occupant's place of business).


In one embodiment, occupiers 110 in the residential community 108 may be able to allow other occupiers 110 to use (e.g., rent and/or borrow) their boarding location(s) 128 and/or autonomous platform(s) 119. The occupier 110 may be able to approve other users in the residential community 108 and/or specify dates and/or times when other occupiers 110 may use the boarding location (s) 128 and/or autonomous platform(s) 119. There may be public boarding locations 128 (e.g., at parks and/or throughout the residential community 108) that may enable shopping carts 120 to deliver items to occupiers 110 when they are not at the boarding locations 128 they are associated with (e.g., the home 114 boarding location 128 and/or the work boarding location 128).



FIG. 4 is a message view 450 showing a processing device of the merchant of FIG. 1 receiving a message, according to one embodiment. In particular, FIG. 4 shows a data processing system 400A, an order 402, an item 404, a description of the item 406, and a location of the item 408. The message 124 may be generated based on the request 116 and/or may be communicated to the data processing system 400 through the network 101. The message 124 may contain the order 402 and/or additional information. In one embodiment, the message 124 may enable the merchant 126 may be able to connect (e.g., communicate) with the occupier 110. The message 124 may contain contact information of the occupier 110 that sent the request 116 (e.g., a phone number and/or a link to the occupier's 110 profile on the neighborhood social network).


In one embodiment, the order 402 may be in the form of a shopping list and/or may contain information about the items desired, the payment method, and/or other additional details. The item 404 may be a good desired by the occupier 110. The description of the item 406 may be a name of the item, a description of the item 406 (e.g., size, color, model), and/or amount of the item 404 desired from the merchant 126. The merchant 126 may be a company, a business, an owner, a worker, and/or an establishment.


The location of the item 408 may be a location in a warehouse of the merchant 126, a geo-spatial location (e.g., the last geo-spatial location at which the item 404 was logged), and/or a location (e.g., a building 702) where the item 404 is located. The serial number of the autonomous platform 302 may be a unique identifier 122 of the autonomous platform 119 associated with the occupier 110 whose request 116 triggered the message 124. The message 124 may also include the boarding location 128 and/or a serial number of the boarding location 128 that the shopping cart 120 is being routed to.


The message 124 may include a comment from the occupier 110. The comment may be a voice and/or textual message 124 composed by the occupier 110 and/or may include a special request 116. The message 124 may include an estimated time of arrival of the shopping cart 120, a time until arrival of the shopping cart 120, a map view 504 through which the merchant 126 may track the progress of the shopping cart 120, and/or the account information of the occupant (e.g., the occupant's credit card information). In one embodiment, the merchant 126 may be able to view past orders 402 of the occupier 110, past comments from the occupier 110, and/or communications between the merchant 126 and the occupier 110 using the data processing system 400A.



FIG. 5 is an alert view 550 of a data processing system of the occupier of FIG. 1 receiving an alert notifying the occupier that the shopping cart has detected an obstacle, according to one embodiment. FIG. 5 shows an alert 500, a map view 504, a route 506, and an obstacle 508.


The alert 500 may be sent as a push notification to the data processing system 400B of the occupier 110. The alert 500 may notify the occupier 110 that the shopping cart 120 has encountered a problem, delay, and/or is experiencing a malfunction (e.g., a system failure, a mechanical malfunction and/or an electrical malfunction). The alert 500 may be triggered when the shopping cart 120 senses an obstacle 508. The obstacle 508 may be an obstruction on the train track 132 and/or an obstruction that prevents and/or inhibits the shopping cart's progress and/or poses a danger to the shopping cart 120 and/or its contents.


The obstacle 508 may be sensed by a sensor of the shopping cart 120. The sensor may include an ultrasound sensor, a radar sensor, a laser sensor, an optical sensor, and/or a mixed signal sensor. The sensor may comprise multiple sensors working in concert. A sensory fusion algorithm may be used to process sensor data.


The alert 500 may inform the occupier 110 of the nature and/or type of the obstacle 508 and/or nature of the progress of the shopping cart 120 (e.g., delays, malfunctions, and/or delivery status). The occupier 110 may be able to request 116 more information about the alert 500 (e.g., the alternate route 506 the shopping cart 120 will use to complete the delivery if an obstacle 508 is sensed). In one embodiment, the alert 500 may include the map view 504 through which the progress of the shopping cart 120 may be tracked in the residential community 108. The map view 504 may show the route 506 of the shopping cart 120 and/or alternate routes available to the shopping cart 120. The map view 504 may display the locations and/or progress of other shopping carts


and/or autonomous platforms 119 in the residential community 108, along the route 506, and/or around a current location of the shopping cart 120. The obstacle 508, location of a malfunction, delay, and/or problem may be represented on the map view 504, according to one embodiment. The occupier 110 may be able to switch between multiple map views 504 (e.g., satellite map view 504 and/or a ground level view) and/or a feed from the shopping cart 120 (e.g., a live video feed).


The alert 500 may include details about the shopping cart 120 and/or the request 116 the shopping cart 120 is fulfilling. In particular, the alert 500 may contain information regarding a payload of the shopping cart 120 (e.g., a weight of items in the shopping cart 120), an environmental state of a container of the shopping cart 120 (e.g., a temperature and/or humidity of the container and/or contents in the container), and/or an image and/or video of the contents of the shopping cart 120. In one embodiment, the occupier 110 may be able to view the current location of the shopping cart 120 (e.g., on a map view 504, through a set of geo-spatial coordinates, and/or through photographs and/or video from the shopping cart 120). The alert 500 may include the remaining power supply and/or information about an obstacle 508, delay, and/or problem encountered. The occupier 110 may be able to view any number of details about the nature of the encountered issue and/or actions taken or to be taken to traverse the issue.


In one embodiment, the alert 500 may prompt and/or enable the occupier 110 to contact a repair service. For example, the repair service may be automatically contacted when the shopping cart 120 detects a break in the train track 132, an obstruction, and/or a system failure. The occupier 110 may be allowed to voluntarily contact the repair services upon receiving the alert 500 (e.g., if the alert 500 regards a failure of the shopping cart 120 associated with the occupier 110). A return function may allow the occupier 110 to instruct the shopping cart 120 to return to a predetermined location (e.g., the boarding location 128 associated with the shopping cart 120 and/or the last boarding location 128 at which the shopping cart 120 arrived (e.g., the boarding location 128 of the merchant 126). The occupier 110 may be able to cancel an order 402 at any time. The order 402 may need to be canceled within a set amount of time after the order 402 was placed (e.g., through receipt of the request 116), within a set amount of time after the merchant 126 fulfilled the request 116, and/or before the shopping cart 120 has reached the destination (e.g., the merchant 126 and/or boarding location 128 of a neighbor in the residential community 108).



FIG. 6 is an interior view 650 of a boarding location in an interior space of the home of the occupier of FIG. 1, according to one embodiment. In particular, FIG. 6 shows an interior space 602, a gate 604, a carrier assembly 606, a light assembly 608, and an ambient lighting 610. In one embodiment, the boarding location 128 may be located in the home 114 (e.g., in the interior space 602 of the home 114). The train track 132 may run through the interior space 602 and/or the shopping cart 120 and/or the autonomous platform 119 may be able to autonomously route 506 itself from the train track 132 to the boarding location 128 in the interior space 602.


The home 114 and/or the building 702 (e.g., the building 702) may include the gate 604 (e.g., a gate 604 with a sealing mechanism (e.g., a door)) through which the shopping cart 120 may travel. The gate 604 may open and/or close automatically when the shopping cart 120 and/or autonomous platform 119 reaches a threshold distance from the gate 604 and/or upon receipt of a command from the autonomous platform 119, shopping cart 120, and/or centralized server 100. The shopping cart 120 and/or autonomous platform 119 may include the light assembly 608 (e.g., a set of light emitting diodes) that automatically provides lighting when the ambient lighting 610 dips below a threshold level. Multiple assemblies may be capable of being attached to the shopping cart 120 and/or the autonomous platform 119. The assembly (e.g., the shopping cart 120) may be a box assembly, a carrier assembly 606, a locker assembly, and/or a person transporter rover assembly.



FIG. 7 is a warehouse view 750 of a product picker loading items into a shopping cart, according to one embodiment. FIG. 7 shows a building 702, a warehouse, and a product picker 706. In one embodiment, the building 702 of the merchant 126 may include the warehouse section. The warehouse section may be a store room and/or a part of the building 702 where inventory is kept.


The building 702 may house product pickers 706 that may be autonomous and/or semi-autonomous robots capable of locating, accessing, and/or moving items in the building 702. In one embodiment, the product picker(s) 706 may locate, acquire, and/or load items in the shopping cart 120 based on the message 124 received from the centralized server 100. The building 702 may have gates 604 and/or boarding location(s) 128 located in the interior space 602 of the building 702. The product pickers 706 may enable the process of shopping carts 120 being provided with appropriate cargo to be automated, removing (e.g., largely removing and/or completely removing) the need for human involvement in the process of completing requests 116 sent by occupiers 110.



FIG. 8 is a critical path view 850 illustrating a flow based on time in which critical operations in delivering a requested item by autonomously routing a shopping cart on a train track in a residential community, according to one embodiment.


In operation 802, an occupier 110 of a home 114 associated with a property boundary 112 sends a request 116 to the centralized server 100 through the network 101. The centralized server 100 autonomously routes a shopping cart 120 from a boarding location 128 of the property boundary 112 to a merchant 126 based on the request 116 of the occupier 110 of the home 114 associated with the property boundary 112 in operation 804. In operation 806, the shopping cart 120 is autonomously routed along a train track 132 in a residential community 108 to the merchant 126.



FIG. 9 is a process flow 950 of autonomously routing a shopping cart on a track in a residential community based on the request of the occupier of a home in the residential community of FIG. 1, according to one embodiment.


Operation 902 may form a train track 132 adjacent to a set of homes 130 in a residential community 108. A boarding location 128 may be placed in a property boundary 112 of each of the set of homes 130 in the residential community 108 in operation 904. Operation 906 may route the train track 132 to a merchant 126 in the residential community 108. A shopping cart 120 may be autonomously routed from at least one boarding location 128 of the property boundary 112 to the merchant 126 based on a request 116 to the merchant 126 based on a request 116 of an occupier 110 of a home 114 associated with the property boundary 112 in operation 908.


Disclosed are a method and system of a train based community, according to one embodiment. In one embodiment, a method includes forming a train track 132 adjacent to a set of homes 130 in a residential community 108, placing a boarding location 128 in a property boundary 112 of each one of the set of homes 130 in the residential community 108, and routing the train track 132 to a merchant 126 in the residential community 108. A shopping cart 120 is autonomously routed from at least one boarding location 128 of the property boundary 112 to the merchant 126 based on a request 116 of an occupier 110 of a home 114 associated with the property boundary 112.


It may be determine that the shopping cart 120 is placed on an autonomous platform 119 associated with the occupier 110 of the home 114 associated with the property boundary 112. The shopping cart 120 may be autonomously routed to the merchant 126 when the shopping cart 120 is placed on the autonomous platform 119. It may be determined that the autonomous platform 119 with the shopping cart 120 is sharing the train track 132 with other autonomous platforms 119 each with shopping carts 120 of other occupiers 110 of other homes 114 in the residential community 108.


The autonomous platform 119 and/or the shopping cart 120 may be permitted to communicate with at least one of neighboring autonomous platforms 119 and neighboring shopping carts 120 through a centralized server 100 (through a wide area network 101) and/or a local area network 101 formed between adjacent ones of the autonomous platform 119 and/or the shopping cart 120 and/or neighboring autonomous platforms 119 and/or neighboring shopping carts 120. The centralized server 100 may include an electronic commerce algorithm 208 through which each occupier 110 of each home 114 of the residential community 108 place an order 402 to purchase an item 404 of the merchant 126 through a neighborhood social network. The autonomous platforms 119 associated with each occupier 110 may be communicatively directed to the merchant 126 and/or other neighbors of the residential community 108 when the shopping cart 120 is placed on the autonomous platform 119 associated with each occupant based on a request 116 of a particular occupier 110 in control of a particular autonomous platform 119.


A message 124 may be automatically communicated to the merchant 126 when the particular occupier 110 places the order 402 to purchase the item 404 of the merchant 126. The message 124 may include a description of the item, a location of the item, an identification of the particular occupier 110, a serial number of the particular autonomous platform 119, and/or a unique identifier 122 of a particular shopping cart 120 associated with the particular autonomous platform 119. The shopping cart 120 may arrive in an interior space 602 of a particular home 114 associated with the particular occupier 110 through a gate 604 through which the particular autonomous platform 119 associated with the particular shopping cart 120 is transportable. The boarding location 128 may be located in the interior space 602 of the home 114.


The particular autonomous platform 119 and/or the particular shopping cart 120 includes a light assembly 608 such that the at least one of the particular autonomous platform 119 and the particular shopping cart 120 automatically provides lighting in when an ambient lighting 610 level dips below a threshold value. A building 702 of the merchant 126 may include a product picker 706 in a warehouse area 704 of the merchant 126 at which the item 404 is loaded when the message 124 is received. The particular autonomous platform 119 and/or the particular shopping cart 120 may detect an obstacle 508 when on a route 506 between the particular home 114 and the merchant 126. The obstacle 508 may be a street, a pedestrian, and/or an object on the train track 132 impeding progress of the particular autonomous platform 119 and/or the particular shopping cart 120.


Multiple different types of assemblies (e.g., a box assembly, a carrier assembly 606, a locker assembly, and/or a person transporter rover assembly) may be attachable to the particular autonomous platform 119. The shopping cart 120 may be personal to the occupier 110. The residential community 108 may be a master planned community.


In another embodiment, a method includes forming a train track 132 adjacent to a set of homes 130 in a residential community 108, placing a boarding location 128 in a property boundary 112 of each one of the set of homes 130 in the residential community 108, routing the train track 132 to a merchant 126 in the residential community 108, and determining that a shopping cart 120 is placed on an autonomous platform 119 associated with an occupier 110 of a home 114 associated with the property boundary 112. The shopping cart 120 may be autonomously routed to the merchant 126 when the shopping cart 120 is placed on the autonomous platform 119.


The shopping cart 120 may be autonomously routed from at least one boarding location 128 of the property boundary 112 to the merchant 126 based on a request 116 of the occupier 110 of the home 114 associated with the property boundary 112. It may be determined that the autonomous platform 119 with the shopping cart 120 is sharing the train track 132 with other autonomous platforms 119 each with shopping carts 120 of other occupiers 110 of other homes 114 in the residential community 108. The autonomous platform 119 and/or the shopping cart 120 may be permitted to communicate with at least one of neighboring autonomous platforms 119 and neighboring shopping carts 120 through a centralized server 100 (through a wide area network) and/or a local area network formed between adjacent ones of the autonomous platform 119 and/or the shopping cart 120 and neighboring autonomous platforms 119 and/or neighboring shopping carts 120.


The centralized server 100 may include an electronic commerce algorithm 208 through which each occupier 110 of each home 114 of the residential community 108 to place an order 402 to purchase an item 404 of the merchant 126 through a neighborhood social network. The autonomous platforms 119 associated with each occupier 110 are communicatively directed to at least one of the merchant 126 and other neighbors of the residential community 108 when the shopping cart 120 is placed on the autonomous platform 119 associated with each occupant based on a request 116 of a particular occupier 110 in control of a particular autonomous platform 119. A message 124 may be automatically communicated to the merchant 126 when the particular occupier 110 places the order 402 to purchase the item 404 of the merchant 126.


The message 124 may include a description of the item, a location of the item, an identification of the particular occupier 110, a serial number of the particular boarding location 128, and/or a unique identifier 122 of a particular shopping cart 120 associated with the particular autonomous platform 119. The shopping cart 120 may arrive in an interior space 602 of a particular home 114 associated with the particular occupier 110 through a gate 604 through which the particular autonomous platform 119 associated with the particular shopping cart 120 is transportable. The boarding location 128 may be located in the interior space 602 of the home 114.


The particular autonomous platform 119 and/or the particular shopping cart 120 may include a light assembly 608 such that the particular autonomous platform 119 and/or the particular shopping cart 120 automatically provides lighting in when an ambient lighting 610 level dips below a threshold value. A building 702 of the merchant 126 may include a product picker 706 in a warehouse area 704 of the merchant 126 at which the item 404 is loaded when the message 124 is received. The particular autonomous platform 119 and/or the particular shopping cart 120 may detect an obstacle 508 when on a route 506 between the particular home 114 and the merchant 126.


The obstacle 508 may be a street, a pedestrian, and/or an object on the train track 132 impeding progress of the particular autonomous platform 119 and/or the particular shopping cart 120. Multiple different types of assemblies may be attachable to the particular autonomous platform 119. The multiple assemblies may include a box assembly, a carrier assembly 606, a locker assembly, and/or a person transporter rover assembly. The shopping cart 120 may be personal to the occupier 110 the residential community 108 may be a master planned community.


In yet another embodiment, a residential community 108 includes a train track 132 formed adjacent to a set of homes 130 in a residential community 108 and routed to a merchant 126 in the residential community 108. A boarding location 128 is placed in a property boundary 112 of each one of the set of homes 130 in the residential community 108. The residential community 108 also includes a shopping cart 120 to autonomously route 506 from at least one boarding location 128 of the property boundary 112 to the merchant 126 based on a request 116 of an occupier 110 of a home 114 associated with the property boundary 112.


A placement algorithm 200 may determine that the shopping cart 120 is placed on an autonomous platform 119 associated with the occupier 110 of the home 114 associated with the property boundary 112. A routing algorithm 202 may autonomously route 506 the shopping cart 120 to the merchant 126 when the shopping cart 120 is placed on the autonomous platform 119. A sharing algorithm 204 may determine that the autonomous platform 119 with the shopping cart 120 is sharing the train track 132 with other autonomous platforms 119 each with shopping carts 120 of other occupiers 110 of other homes 114 in the residential community 108.


A communication algorithm 206 may permit the autonomous platform 119 and/or the shopping cart 120 to communicate with neighboring autonomous platforms 119 and/or neighboring shopping carts 120 through a centralized server 100 (through a wide area network) and/or a local area network formed between adjacent ones of the autonomous platform 119 and/or the shopping cart 120 and neighboring autonomous platforms 119 and/or neighboring shopping carts 120. An electronic commerce algorithm 208 may enable each occupier 110 of each home 114 of the residential community 108 to place an order 402 to purchase an item 404 of the merchant 126 through a neighborhood social network. A direction algorithm to communicatively direct the shopping cart 120 associated with each occupier 110 to at least one of the merchant 126 and other neighbors of the residential community 108 when the shopping cart 120 is placed on the boarding location 128 associated with each occupant based on a request 116 of a particular occupier 110 in control of a particular autonomous platform 119.


A message algorithm 212 may automatically communicate a message 124 to the merchant 126 when the particular occupier 110 places the order 402 to purchase the item 404 of the merchant 126. The message 124 may include a description of the item, a location of the item, an identification of the particular occupier 110, a serial number of the particular autonomous platform 119, and/or a unique identifier 122 of a particular shopping cart 120 associated with the particular autonomous platform 119. The shopping cart 120 may arrive in an interior space 602 of a particular home 114 associated with the particular occupier 110 through a gate 604 through which the particular autonomous platform 119 associated with the particular shopping cart 120 is transportable. The boarding location 128 may be located in the interior space 602 of the home 114.


The particular autonomous platform 119 and/or the particular shopping cart 120 may include a light assembly 608 such that the particular autonomous platform 119 and/or the particular shopping cart 120 automatically provides lighting in when an ambient lighting 610 level dips below a threshold value. A building 702 of the merchant 126 may include a product picker 706 in a warehouse area 704 of the merchant 126 at which the item 404 is loaded when the message 124 is received.


The particular autonomous platform 119 and/or the particular shopping cart 120 may detect an obstacle 508 when on a route 506 between the particular home 114 and the merchant 126. The obstacle 508 may be a street, a pedestrian, and/or an object on the train track 132 impeding progress of the particular autonomous platform 119 and/or the particular shopping cart 120. Multiple different types of assemblies (e.g., a box assembly, a carrier assembly 606, a locker assembly, and/or a person transporter rover assembly) may be attachable to the particular autonomous platform 119. The shopping cart 120 may be personal to the occupier 110. The residential community 108 may be a master planned community.


An example embodiment will now be described. In one example embodiment, Lisa may have a home 114 in the residential community 108. She may have her own shopping cart 120 associated with a boarding location 128 in her home 114. She may be able to use the shopping cart 120 to complete errands rather than having to do her shopping and other errands on her own.


Lisa may be able to send a request 116 to have the contents of her shopping list delivered to her house. In one embodiment, the store from where the items are desired may receive the shopping list in the form of a message 124. The store (e.g., the merchant 126) may load a shopping cart 120 associated with the merchant 126 and/or route 506 the shopping cart 120 along a train track 132 integrated in the residential community 108 to the boarding location 128 associated with Lisa. The shopping cart 120 may be autonomously routed back to the merchant 126 once the contents have been removed, Lisa confirms delivery, and/or payment has been made.


Lisa's shopping cart 120 may be autonomously routed along the train track 132 from the boarding location 128 associated with Lisa to the merchant 126 based on the request 116. The merchant 126 may load the desired items on and/or in the shopping cart 120 and/or the shopping cart 120 may be routed from a boarding location 128 of the merchant 126 to Lisa's boarding location 128.


In another example embodiment, Mike may not have time to run his errands and/or may not want to spend time and/or money transporting goods. Mike may use a shopping cart 120 to deliver his dry cleaning to his favorite dry cleaner. He may place his dirty clothing in the shopping cart 120, lock the shopping cart 120, and/or set a passcode to open the shopping cart 120. He may send a request 116 to have the shopping cart 120 routed to the dry cleaner and may specify his order 402 (e.g., starch, pressed, folded, and/or desired time of pick up). A message 124 may be sent to the merchant 126 (e.g., the dry cleaner) based on the request 116. The message 124 may contain the passcode set by Mike so that the dry cleaner may unlock the contents of the shopping cart 120. The dry cleaner may send the cleaned clothing back to Mike's boarding location 128 (e.g., the boarding location 128 in the property boundary 112 associated with Mike's home 114) when the request 116 has been completed.


In yet another example embodiment, a family, the Johnsons, may be on a picnic in a park in the residential community 108. They may realize that they forgot items they would like for their picnic. The park may have a public boarding location 128. The Johnsons may be able to send a request 116 for the desired items to be delivered from a helpful neighbor (e.g., a friend on the neighborhood social network) to the public boarding location 128 at the park. The shopping cart 120 associated with the Johnsons (e.g., the shopping cart 120 associated with the boarding location 128 in the property boundary 112 of the Johnson's home 114) may be routed to the appropriate neighbor and/or from the neighbor to the boarding location 128 of the park.


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 method, comprising: forming a train track adjacent to a set of homes in a residential community;placing a boarding location in a property boundary of each one of the set of homes in the residential community;routing the train track to a merchant in the residential community;autonomously routing a shopping cart from at least one boarding location of the property boundary to the merchant based on a request of an occupier of a home associated with the property boundary; andautonomously routing the shopping cart to the merchant when the shopping cart is placed on an autonomous platform.
  • 2. The method of claim 1 further comprising: determining that the shopping cart is placed on the autonomous platform associated with the occupier of the home associated with the property boundary.
  • 3. The method of claim 2 further comprising: determining that the autonomous platform with the shopping cart is sharing the train track with other autonomous platforms each with shopping carts of other occupiers of other homes in the residential community; andpermitting at least one of the autonomous platform and the shopping cart to communicate with at least one of neighboring autonomous platforms and neighboring shopping carts through an at least one of:a centralized server through a wide area network, anda local area network formed between adjacent ones of the at least one of the autonomous platform and the shopping cart and at least one of neighboring autonomous platforms and neighboring shopping carts.
  • 4. The method of claim 3: wherein the centralized server includes an electronic commerce algorithm through which each occupier of each home of the residential community to place an order to purchase an item of the merchant through a neighborhood social network, andwherein the autonomous platforms associated with each occupier are communicatively directed to at least one of the merchant and other neighbors of the residential community when the shopping cart is placed on the autonomous platform associated with each occupant based on a request of a particular occupier in control of a particular autonomous platform.
  • 5. The method of claim 4 further comprising: automatically communicating a message to the merchant when the particular occupier places the order to purchase the item of the merchant,wherein the message includes at least one of a description of the item, a location of the item, an identification of the particular occupier, a serial number of the particular autonomous platform, and a unique identifier of a particular shopping cart associated with the particular autonomous platform,wherein the shopping cart arrives in an interior space of a particular home associated with the particular occupier through a gate through which the particular autonomous platform associated with the particular shopping cart is transportable, andwherein the boarding location is located in the interior space of the home.
  • 6. The method of claim 5: wherein at least one of the particular autonomous platform and the particular shopping cart includes a light assembly such that the at least one of the particular autonomous platform and the particular shopping cart automatically provides lighting in when an ambient lighting level dips below a threshold value,wherein a building of the merchant includes a product picker in a warehouse area of the merchant at which the item is loaded when the message is received, andwherein at least one of the particular autonomous platform and the particular shopping cart detects an obstacle when on a route between the particular home and the merchant, wherein the obstacle is at least one of a street, a pedestrian, and an object on the train track impeding progress of the at least one of the particular autonomous platform and the particular shopping cart.
  • 7. The method of claim 6: wherein multiple different types of assemblies are attachable to the particular autonomous platform comprising any one of a box assembly, a carrier assembly, a locker assembly, and a person transporter rover assembly,wherein the shopping cart is personal to the occupier, andwherein the residential community is a master planned community.
  • 8. A method, comprising: forming a train track adjacent to a set of homes in a residential community;placing a boarding location in a property boundary of each one of the set of homes in the residential community;routing the train track to a merchant in the residential community;determining that a shopping cart is placed on an autonomous platform associated with an occupier of a home associated with the property boundary;autonomously routing the shopping cart to the merchant when the shopping cart is placed on the autonomous platform; andautonomously routing the shopping cart from at least one boarding location of the property boundary to the merchant based on request of the occupier of the home associated with the property boundary.
  • 9. The method of claim 8 further comprising: determining that the autonomous platform with the shopping cart is sharing the train track with other autonomous platforms each with shopping carts of other occupiers of other homes in the residential community; andpermitting at least one of the autonomous platform and the shopping cart to communicate with at least one of neighboring autonomous platforms and neighboring shopping carts through an at least one of:a centralized server through a wide area network, anda local area network formed between adjacent ones of the at least one of the autonomous platform and the shopping cart and at least one of neighboring autonomous platforms and neighboring shopping carts.
  • 10. The method of claim 9: wherein the centralized server includes an electronic commerce algorithm through which each occupier of each home of the residential community to place an order to purchase an item of the merchant through a neighborhood social network, andwherein the autonomous platforms associated with each occupier are communicatively directed to at least one of the merchant and other neighbors of the residential community when the shopping cart is placed on the autonomous platform associated with each occupant based on a request of a particular occupier in control of a particular autonomous platform.
  • 11. The method of claim 10 further comprising: automatically communicating a message to the merchant when the particular occupier places the order to purchase the item of the merchant,wherein the message includes at least one of a description of the item, a location of the item, an identification of the particular occupier, a serial number of the particular boarding location, and a unique identifier of a particular shopping cart associated with the particular autonomous platform,wherein the shopping cart arrives in an interior space of a particular home associated with the particular occupier through a gate through which the particular autonomous platform associated with the particular shopping cart is transportable, andwherein the boarding location is located in the interior space of the home.
  • 12. The method of claim 11: wherein at least one of the particular autonomous platform and the particular shopping cart includes a light assembly such that the at least one of the particular autonomous platform and the particular shopping cart automatically provides lighting in when an ambient lighting level dips below a threshold value,wherein a building of the merchant includes a product picker in a warehouse area of the merchant at which the item is loaded when the message is received, andwherein at least one of the particular autonomous platform and the particular shopping cart detects an obstacle when on a route between the particular home and the merchant, wherein the obstacle is at least one of a street, a pedestrian, and an object on the train track impeding progress of the at least one of the particular autonomous platform and the particular shopping cart.
  • 13. The method of claim 12: wherein multiple different types of assemblies are attachable to the particular autonomous platform comprising any one of a box assembly, a carrier assembly, a locker assembly, and a person transporter rover assembly,wherein the shopping cart is personal to the occupier, andwherein the residential community is a master planned community.
  • 14. A residential community, comprising: a train track formed adjacent to a set of homes in a residential community and routed to a merchant in the residential community, wherein a boarding location is placed in a property boundary of each one of the set of homes in the residential community; anda shopping cart to autonomously route from at least one boarding location of the property boundary to the merchant based on a request of an occupier of a home associated with the property boundary, wherein a routing algorithm to autonomously route the shopping cart to the merchant when the shopping cart is placed on an autonomous platform.
  • 15. The residential community of claim 14 further comprising: a placement algorithm to determine that the shopping cart is placed on the autonomous platform associated with the occupier of the home associated with the property boundary.
  • 16. The residential community of claim 15 further comprising: a sharing algorithm to determine that the autonomous platform with the shopping cart is sharing the train track with other autonomous platforms each with shopping carts of other occupiers of other homes in the residential community; anda communication algorithm to permit at least one of the autonomous platform and the shopping cart to communicate with at least one of neighboring autonomous platforms and neighboring shopping carts through an at least one of:a centralized server through a wide area network, anda local area network formed between adjacent ones of the at least one of the autonomous platform and the shopping cart and at least one of neighboring autonomous platforms and neighboring shopping carts.
  • 17. The residential community of claim 16, further comprising: an electronic commerce algorithm to enable each occupier of each home of the residential community to place an order to purchase an item of the merchant through a neighborhood social network; anda direction algorithm to communicatively direct the shopping cart associated with each occupier to at least one of the merchant and other neighbors of the residential community when the shopping cart is placed on the boarding location associated with each occupant based on a request of a particular occupier in control of a particular autonomous platform.
  • 18. The residential community of claim 17 further comprising: a message algorithm to automatically communicate a message to the merchant when the particular occupier places the order to purchase the item of the merchant,wherein the message includes at least one of a description of the item, a location of the item, an identification of the particular occupier, a serial number of the particular autonomous platform, and a unique identifier of a particular shopping cart associated with the particular autonomous platform,wherein the shopping cart arrives in an interior space of a particular home associated with the particular occupier through a gate through which the particular autonomous platform associated with the particular shopping cart is transportable, andwherein the boarding location is located in the interior space of the home.
  • 19. The residential community of claim 18: wherein at least one of the particular autonomous platform and the particular shopping cart includes a light assembly such that the at least one of the particular autonomous platform and the particular shopping cart automatically provides lighting in when an ambient lighting level dips below a threshold value,wherein a building of the merchant includes a product picker in a warehouse area of the merchant at which the item is loaded when the message is received,wherein at least one of the particular autonomous platform and the particular shopping cart detects an obstacle when on a route between the particular home and the merchant, wherein the obstacle is at least one of a street, a pedestrian, and an object on the train track impeding progress of the at least one of the particular autonomous platform and the particular shopping cart,wherein multiple different types of assemblies are attachable to the particular autonomous platform comprising any one of a box assembly, a carrier assembly, a locker assembly, and a person transporter rover assembly,wherein the shopping cart is personal to the occupier, andwherein the residential community is a master planned community.
US Referenced Citations (1020)
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
4671186 Kunczynski Jun 1987 A
4779203 McClure et al. Oct 1988 A
4914605 Loughmiller, Jr. et al. Apr 1990 A
4996468 Field et al. Feb 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
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
5838566 Conboy 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
6059092 Jerue May 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
6600418 Francis et al. Jul 2003 B2
6611751 Warren Aug 2003 B2
6615039 Eldering Sep 2003 B1
6622086 Polidi Sep 2003 B2
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
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
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 Hiroyuki 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
7079943 Flann et al. Jul 2006 B2
7080019 Hurzeler Jul 2006 B1
7080096 Imamura Jul 2006 B1
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
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
7693745 Pomerantz Apr 2010 B1
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
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
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
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
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
8103734 Galli et al. Jan 2012 B2
8107879 Pering 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
8145703 Frishert et al. Mar 2012 B2
8149113 Diem Apr 2012 B2
8167234 Moore May 2012 B1
8171128 Zuckerberg 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
8253557 Ani 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
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
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
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
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
8666660 Sartipi et al. Mar 2014 B2
8671095 Gross Mar 2014 B2
8671106 Lee et al. Mar 2014 B1
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
8732155 Vegnaduzzo et al. May 2014 B2
8732219 Ferries et al. May 2014 B1
8732846 D'Angelo et al. 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
9230387 Stiernagle Jan 2016 B2
9256852 Myllymaki Feb 2016 B1
9436926 Cousins Sep 2016 B2
9520012 Stiernagle Dec 2016 B2
9674812 Skaaksrud Jun 2017 B2
20010016795 Bellinger Aug 2001 A1
20010020955 Nakagawa et al. Sep 2001 A1
20010029426 Hancock 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
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
20030165373 Felder Sep 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
20030222918 Coulthard Dec 2003 A1
20030225632 Tong et al. Dec 2003 A1
20030225833 Pilat et al. Dec 2003 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
20040054428 Sheha et al. Mar 2004 A1
20040056762 Rogers Mar 2004 A1
20040088177 Travis et al. May 2004 A1
20040093650 Martins 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
20050029029 Thorne 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
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
20050216120 Rosenberg Sep 2005 A1
20050216186 Barnaby 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
20050238465 Razumov 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
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
20070182181 Cohen 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
20070219712 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
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
20080208956 Spiridellis et al. Aug 2008 A1
20080215994 Harrison et al. Sep 2008 A1
20080221846 Aggarwal et al. Sep 2008 A1
20080222140 Lagad 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
20080243378 Zavoli Oct 2008 A1
20080243667 Lecomte Oct 2008 A1
20080243830 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
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
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
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
20110128144 Baron, Sr. et al. Jun 2011 A1
20110131172 Herzog et al. Jun 2011 A1
20110151898 Chandra et al. Jun 2011 A1
20110163160 Zini Jul 2011 A1
20110174920 Yoeli Jul 2011 A1
20110181470 Qiu et al. Jul 2011 A1
20110202426 Cretney et al. Aug 2011 A1
20110218839 Shamaiengar Sep 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
20110313880 Paul et al. 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
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
20120239224 McCabe 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
20120298688 Stiernagle Nov 2012 A1
20120331002 Carrington Dec 2012 A1
20130024108 Raimund 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
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
20130234849 Gupta et al. 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
20130332021 Goren Dec 2013 A1
20140032034 Raptopoulos et al. Jan 2014 A1
20140040179 Herzog et al. Feb 2014 A1
20140067167 Levien et al. Mar 2014 A1
20140067704 Abhyanker Mar 2014 A1
20140074736 Carrington Mar 2014 A1
20140081445 Villamar Mar 2014 A1
20140081450 Kuehnrich et al. Mar 2014 A1
20140095293 Abhyanker Apr 2014 A1
20140108540 Crawford Apr 2014 A1
20140108613 Randall Apr 2014 A1
20140114866 Abhyanker Apr 2014 A1
20140115671 Abhyanker Apr 2014 A1
20140123246 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 Aug 2014 A1
20140232903 Oshima Aug 2014 A1
20140254896 Zhou Sep 2014 A1
20140277834 Levien et al. Sep 2014 A1
20140316243 Niedermeyer Oct 2014 A1
20150006005 Yu Jan 2015 A1
20150202770 Patron Jul 2015 A1
20150274421 Yamada Oct 2015 A1
20150317596 Hejazi Nov 2015 A1
20170219676 Tran Aug 2017 A1
Foreign Referenced Citations (13)
Number Date Country
1426876 Jun 2004 EP
101069834 Oct 2010 KR
1020120121376 Jul 2012 KR
2002019236 Mar 2002 WO
2002041115 May 2002 WO
2006020471 Feb 2006 WO
2007113844 Oct 2007 WO
2008105766 Sep 2008 WO
2008108772 Sep 2008 WO
2008118119 Oct 2008 WO
2008111929 Nov 2008 WO
2010103163 Sep 2010 WO
2014121145 Aug 2014 WO
Non-Patent Literature Citations (54)
Entry
“Crowdsourcing: Those that are willing to test & learn will be those that will win”, Newsline, Mar. 1, 2011 by Neil Perkin http://mediatel.co.uk/newsline/2011/03/01/crowdsourcing-those-that-are-willing-to-test-learn-will-be-those-that-will-win/.
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-stole-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 (12) {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 CrunchBase, 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 CrunchBase, 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.
Screenshot 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.
“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.
Related Publications (1)
Number Date Country
20150371178 A1 Dec 2015 US