Disclosed herein are implementations of various methods and systems of a network and commodity exchange to transact and trade transportation seats or capacity units in airline transport, subway transport, train transport, automobile transport, autonomous vehicle transport, taxi transport, space transport, virtual transport, underground transport, ship or sea transport, or drone transport on a computer, mobile computer device, virtual reality computer device or mixed reality computing device. Implementations of methods will occur in various modules considering, but not limited to, all forms of transportation and movement of freight. Transportation systems have generally assumed transportation is a personalized good rather than a commodity which is substitutable. In the United States, 85% of all vehicles ride with a single passenger in the vehicle, which is a tremendously inefficient use of energy and causes high levels of traffic congestion. While carpools have existed for many decades, they are largely not utilized by a majority of the population because the time involved to coordinate schedules outweighs the benefit of cost savings and reduced energy use. Mobile networks have allowed for the rise of transportation service companies that promote the use of pooling and hired drivers, but the cost of these systems has continued to be expensive for the majority of the public, which has held back wide scale adoption. Further, transportation companies have created systems which allow the company to set the prices of transportation capacity rather than a transparent marketplace. The implementation of the methods and systems disclosed herein creates an open and transparent market, which forces the lowest cost solution to dominate the market since all participants have equal access to the market exchange for transportation capacity units. It is a known fact that transparent open access markets create the lowest price for a good or service with fungible characteristics. The lowest cost and most efficient solution will greatly reduce pollution, increase transportation capacity utilization rates, reduce traffic congestion, and save consumers of transportation services trillions in cost by increasing utilization rates. An open access transparent system for trading transportation capacity will also ensure that new technologies, such as autonomous cars, do not become elitist and are only reserved for the wealthy and do not actually add to pollution and congestion problems as New York City has seen with networked transportation companies. Transportation is currently one of the most inefficient markets in the world, and a transportation exchange for transportation capacity units will bring market discipline and low-cost commodity pricing to all classes and forms of transportation capacity and services.
The current economic system and global network generally assumes that the economic choice with the highest level of utility and highest level of efficiency is one governed by acting in self-interest with competition. Modern economic game theory suggests that the former assumption can be improved not by acting in self-interest in an atmosphere of competition, but by also considering the economic outcome for the group as well as self-interest. In the specific economic case of transportation, there is no market to make transparent the economic cost of not valuing transportation capacity down to the commodity unit level. Because the market for transportation is generally valued at the whole vehicle level, tremendous inefficiencies exist. These inefficiencies are for the benefit of large fuel companies, large auto companies, and large transportation companies, and they are at the expense of the consumer who must buy more transportation than they need because there is no market for smaller units. Accordingly, inefficient choices are made which waste a great deal of energy and time. Most participants in the current economic system simply do not know how their choices affect others in the system, especially that choices in the developed world may affect disproportionately the outcomes for those in the undeveloped world or the wealthy compared to those with fewer resources. The current system is not linked, and, therefore, sub-optimal economic outcomes are achieved because there are limited governing mechanisms to consider the global group outcome. A transparent open access system and method for trading transportation units solves these inefficiencies by placing the discipline of a market to the poorly utilized excesses.
Further making the argument for this new and novel method and system, as disclosed herein, to valuing transportation capacity, are the example of large public subway systems in New York City, Paris, or London, as a few examples. In these metropolitan markets, people of all ethnicities, all sex types, and all income levels ride the public subway system. In these markets, each consumer buys an individual seat, and they then are allowed to sit in any seat. However, there is no designation of where they sit, only that they are given a space on the transportation method. The aforementioned example is evidence that seats are interchangeable and that they indeed fit the definition of a fungible commodity, which is one of the many bases and premises for the proposed new and novel invention. It is widely known that products which fit the definition of a commodity are most efficiently priced in transparent commodity markets, and commodity exchanges have been set up for those products, such as oil, power, natural gas, foreign exchange, gold, silver, wheat, and many other products. Even though the basis of a fungible commodity product definition is met through the example of a public subway system, the subway market continues to exist as a fixed price market set by the local transportation authorities. Again, the public subway system could be further improved by allowing a variable transparent market system to be added to the subway systems of the world. No such commodity trading market has existed for transportation units because the solution to integrate the technical requirements are complex and novel. The method and system of the transportation capacity exchange of the new and novel invention of this patent document solves the complicated market problem and provides the most efficient system and market based solution to pricing transportation in such a way that the global consumer will save money by using market pricing, methods, and systems as disclosed herein to fully utilize all market transportation capacity to the fullest extent possible. Because a market is setting the price of the methods and systems of the aforementioned novel invention, rather than a company, the solution is the most elegant and mathematically efficient answer for the global economy.
City planners across the globe discuss the field of shared-use mobility, which encompasses transportation services that are shared among users, including: public transit; taxis and limos; bikesharing, carsharing (round-trip, one-way, and personal vehicle sharing); ridesharing (car-pooling, van-pooling); ridesourcing; ride-splitting; scooter sharing; shuttle services; neighborhood jitneys; and commercial delivery vehicles providing flexible goods movement. It is the use of any combination of shared mobility services, as described above, that have the effect of improving options to travel without a vehicle. Yet, in all these plans and studies, there has never been a proposal to integrate the power of a transparent marketplace to transportation capacity, which elegantly combines technology to make the concept feasible with market mechanisms and methods. The key to motivate the move to shared-use mobility is to integrate a commodity market to trade the individual value of a single unit of capacity, which has not been done by any other prior art or patent globally and has not been practiced by any business. The novelty of the method and system is to combine the technology of commodity markets with global positioning system (“GPS”) location services and defining transportation as hub to hub capacity, as has been accomplished in energy markets among other methods and systems. Ample market participants actively and physically participate in hub-to-hub transportation already, and the unitized capacity of transport is a tradable commodity if the systems and methods exist to trade and price the market in such a manner.
Similarly, a highly publicized New York City study found that the services provided by transportation network companies (TNCs) created a net increase of 600 million vehicle miles traveled in New York City during 2016, which was a three to four percent increase in traffic citywide. Accordingly, the method and systems of the prior art are actually making city congestion problems worse, not better. While governments suggest effective policy leading towards shared—use vehicles and services, and away from single occupancy uses, much more is needed to prevent worsening congestion. Instead, a much simpler solution is to utilize an open access transparent marketplace for virtual hub to virtual hub transportation capacity, such as is accomplished in the contents of this patent document and novel invention. The solution is therefore fundamentally different, novel, and unique compared to the models and patents pursued by TNCs.
Using methods and systems of a transparent virtual hub to virtual hub market for transportation capacity to promote shared-use practices will have the immediate benefits of taking drivers off the road and reducing congestion, greenhouse gas emissions, and household transportation costs, even without the benefit of electric and autonomous vehicles, thereby offering a more immediate way to shape the future with affordable, accessible, and equitable multimodal options. Cultivating shared mobility practices now is important to start the behavioral shift towards a shared, electric, and autonomous vehicle future.
Shared-use vehicle technology is already here and is advancing, but it has been a slow process because there has yet to be an open access transportation marketplace or exchange to make transparent the price of a single unit of transportation capacity. The proposed technology may be utilized with a range of services, such as: a public transportation service as the backbone of the transportation network; individual shared services that can provide first and last mile options; or multi-passenger “micro-transit” options operated in areas where high-capacity transit is not feasible. Another way to view the contents of this patent is that the method and system will have the effect of creating a virtual hub to virtual hub subway (using various transportation types) in every city throughout the world through multiple methods of transportation. The alternative or status quo has led to urban planning infrastructure expenses that are skyrocketing, congestion that has become unmanageable in most urban areas, escalating pollution and resulting health care costs, increased vehicular deaths from congestion, and excessive costs at the consumer level, which can be reduced significantly. The patent invention method and system creates harnesses program instructions so that a market force can bring these benefits in a way that clearly has been unobtainable in the past through other methods and inventions. If another system and method were solving these problems, then there would be clear evidence as a counter-example in the market. However, no such evidence exists. In fact, evidence suggests all of these aforementioned problems have escalated with alternative inventions that have been patented and moved forward in business models for the marketplace.
The following descriptions and examples are not admitted to be prior art by virtue of their inclusion within this section.
The current implementations of methods to use networks and computer systems to carpool are generally governed by single companies that set the price using non-transparent mechanisms. Further, most implementations of methods do not allow price discovery between various sellers and buyers of transportation because the systems are disparate and are not open access or transparent. The majority of mobile method and system transportation services utilize mobile technology, GPS, and system algorithms to manage transportation as a service, which is fundamentally different than viewing transportation as a commodity and as a commodity market, which the proposed system and method accomplish. Competing methods price transportation as a service, with the consumer buying multiple units with no transparent marketplace governing price competition for a single unit along a hub to hub route. Additional competing implementations of methods do not allow for forward selling or forward purchasing of transportation seats or capacity beyond a single transaction, which a commodity forward market allows through the systems and methods. An open and transparent market allows for large increases in price discovery and by economic theory results in the lowest possible price for consumers. City planners from New York to Austin to San Francisco to Paris to Mumbai to Tokyo to Beijing to Sao Paulo or Johannesburg all struggle to see how the future options of transportation will shape city planning. City planners have large concerns that, when markets move to autonomous cars, cities will still have massive congestion problems if people continue to ride as a single passenger in one car. Accordingly, the proposed novel invention allows for significant new product offerings and much higher utilization rates by redefining the market into unitized commodity units in transportation capacity markets and providing the technology methods and systems to accomplish the goal of higher efficiency and lower consumer pricing for transportation units.
Implementations of methods have been made in systems that provide transportation on demand through technology methods and systems, but none frame the problem as a forward commodity market or a unitized capacity market with simple elegant systems and methods that allow the natural forces of supply and demand to set the price through a universally transparent medium, such as a transportation capacity exchange. Additionally, no prior art system or method proposes a technically capable solution of integrating the technical software and hardware requirements for integrating the tasks of a network, GPS system, mobile computing devices, servers, forward commodity exchanges, grouping software for hubs, transparent open access pricing systems, blockchain audit and safety methods and systems, virtual hub systems, or algorithms for no arbitrage conditions in a simple, easy-to-use graphical user interface format for mobile or virtual computing over various mediums that are connected via a network.
The claimed subject matter is not limited to implementations that solve any or all of the noted disadvantages. Further, the summary section is provided to introduce a selection of concepts in a simplified form that are further described below in the detailed description section. The summary section is not intended to identify key features or essential features of the claimed subject matter, nor is it intended to be used to limit the scope of the claimed subject matter.
The aforementioned deficiencies and other problems associated with the general transportation market, other novel systems and interfaces, and how transportation functions with large inefficiencies, which use electronic devices to hail taxicabs or carpooling services, are reduced or eliminated by the disclosed method and system of integrating and interfacing a plurality of systems into one system, which allows the efficiency of a market to price and ration unused spaced as to eliminate wasted seats or capacity. In some embodiments, the methods and systems are on portable devices. In some embodiments, the methods and systems are on stationary devices. In yet other embodiments, the methods and system disclosed may use mixed reality, augmented reality, virtual reality, or other visualization methods to allow a user to transact and trade transportation capacity as a forward commodity. In some embodiments, the graphical user interface (“GUI”) on any mobile or stationary computer device interfaces with one or more processors, memory, and one or more modules, programs, or sets of instructions stored in the memory for performing multiple functions. In some embodiments, the user interacts with the GUI primarily through finger contacts, voice commands, or other sensory methods to interface with the GUI. In some embodiments, the functions may include the user directing the GUI to place a user profile in a virtual hub so that they may participate, transact, or trade a combination of virtual hub transportation routes as a forward commodity for transportation capacity. In some embodiments, the functions may include the user instructing the GUI to participate, transact, or trade various modes of transportation capacity, such as automobile, air, autonomous vehicle, bike, boat, bus, drone, limo, motorcycle, moped, shuttle, space, subway, taxi, train, other transportation methods, cargo, packages, virtual or various combinations of the aforementioned modes. In some embodiments, the functions may include the user instructing the GUI to form a new or existing virtual hub, or virtual hub combination, which then has a specification function that forms a basis for the GUI to present the plurality of buyers and sellers of transportation capacity between two or more virtual hubs.
In an aspect of the invention, a computer-implemented method for use in conjunction with a computing device with various display formats comprises: a user at a mobile or fixed computing device with a touchscreen, a computing device without a touchscreen, or an augmented reality non-screen display, detecting a user network login, detecting and receiving from the user through the GUI user input or GPS coordinate input from the computing device, detecting from the user input a destination coordinate and transmission of said coordinates, generating and applying one or more optimization techniques to form a virtual hub with other users that have similar transportation requests within a geographic boundary, generating instructions for a plurality of computing devices, networks, virtual hub database servers, network member database servers, transportation exchange database servers to form a combination of virtual hubs and contract specifications for delivery of transportation services or capacity between the virtual hubs in a format presented by a GUI, which allows the user to submit prices to sell (offer) or bid (buy) transportation capacity between virtual hub combinations, and generating instructions to interface a plurality networks, global positioning systems networks, servers, forward commodity exchanges, grouping software for virtual hubs, transparent open access pricing systems, blockchain audit and safety systems, virtual hub servers and systems, and no arbitrage constraint condition systems, which form one system to implement a forward commodity transportation capacity unit exchange system and method. The programs and instructions are stored in memory and configured to be executed by one or more processes by a plurality of users. The programs may include a plurality of configurations and specification instructions for various modes of transportation capacity. The programs also may include specification options to select a plurality of timings, quality levels of capacity and service, term of timings, such as by the second, minute, hour, day, weekday, weekend, month, annual, or day of the week, various order types such as day, good till cancelled, immediate or cancel, good till date, day till cancelled, limit, market, market if touched, snap market, snap mid, snap to primary, peg to benchmark, and adaptive custom orders. The programs may also include a plurality of instruction modes, such as automobile, air, autonomous vehicle, bike, boat, bus, drone, limo, motorcycle, moped, shuttle, space, subway, taxi, train, packages, and cargo for transportation capacity. The programs also may include instructions for virtual hub pick up and drop off points, as well as instructions to set various constraints, such as cheapest route, single mode, multi-mode, fastest route, most scenic route, highest rating, most available or liquid, highest volume, most frequent, and service level. The programs and instructions from the GUI provide master instructions for the plurality of computing devices and servers that interface to allow the user to participate, transact, and trade a plurality of transportation capacity modes between a plurality of virtual hubs.
In another aspect of the invention, a computing system comprises: a plurality of networks, global positioning systems networks, servers, forward commodity exchange servers and instructions, grouping program instructions for virtual hubs and associated servers, transparent open access pricing servers and instructions, blockchain audit and safety servers and instructions, virtual hub servers and instructions, and no arbitrage constraint condition servers and instructions, which form one system to implement a forward commodity transportation capacity unit exchange system and method.
Implementations of various technologies will hereafter be described with reference to the accompanying drawings. It should be understood, however, that the accompanying drawings illustrate only the various implementations described herein and are not meant to limit the scope of various technologies described herein.
The discussion below is directed to certain specific implementations. It is to be understood that the discussion below is only for the purpose of enabling a person with ordinary skill in the art to make and use any subject matter defined now or later by the patent “claims” found in any issued patent herein. In other instances, well-known methods, procedures, components, circuits and networks have not been described in detail so as not to unnecessarily obscure aspects of the embodiments.
It will also be understood that, although certain elements of the invention and subject matter will be described in a certain order, the order is not intended to be limiting to the invention as many steps may be performed in a plurality of configurations to accomplish the invention of using various technologies to participate, trade and transact transportation as a physical forward commodity. It will be further understood that the terms “comprises” or “comprising,” when used in this specification, specify the presence of stated features, integers, steps, operations, elements, and/or components, but do not preclude the presence or addition of one or more other features, integers, steps, operations, elements, components, and/or groups thereof.
The terminology used in the description of the invention herein is for the purpose of describing particular embodiments only and is not intended to be limiting of the invention. As used in the description of the invention, the singular forms “a”, “an” and “the” are intended to also include the plural forms as well, unless the context clearly indicates otherwise. It will also be understood that the term “and/or” as used herein refers to and encompasses any and all possible combinations of one or more of the associated listed items. It will be further understood that the terms “comprises” and/or “comprising,” when used in this specification, specify the presence of stated features, integers, steps, operations, elements, components, but do not preclude the presence or addition of one or more other features, integers, steps, operations, elements, components, and/or groups thereof.
As used herein, the term “if” may be construed to mean “when” or “upon” or “in response to determining” or “in response to detecting,” depending on the context. Similarly the phrase “if it is determined” or “if [a stated condition or event] is detected” may be construed to mean “upon determining” or “in response to determining” or “upon detecting [the stated condition or event]” or “in response to detecting [the stated condition or event],” depending on the context.
Embodiments of a mobile computing device may be substituted for a fixed stationary computing device, a virtual reality headset, a mixed reality headset, or an augmented reality headset. Embodiments may also occur on a projection computing device or in any other method or system which communicates and integrates the use of a network, global positioning system network, mobile computing devices, servers, forward commodity exchanges, grouping software instructions for hubs, virtual hub methods and systems, transparent open access user interface pricing systems, blockchain audit and safety methods, or algorithms for no arbitrage conditions and constraints with a user interface or graphical user interface formatted on mobile or stationary computing devices over various mediums that are connected through a network for the purpose of participating, transacting, or trading transportation capacity units between combinations of virtual hubs as a forward commodity.
The following paragraphs provide various techniques of various embodiments described herein such as illustrated as in
Exemplary virtual hub combination 311;
Exemplary virtual hub origin/from location 310 with users 312 within the virtual hub location 310;
Exemplary specification summary of the market, level of service and time of delivery commencement 327;
Exemplary mode of transportation capacity type 330;
Exemplary transaction summary of the last trades quantity and price 328;
Exemplary virtual hub destination/to location 322 and user who is being delivered on the transportation capacity unit 323;
Exemplary bid/buy quantity title header 315 for an exemplary virtual transportation hub market;
Exemplary bid/buy price title header 316 for an exemplary virtual transportation hub market;
Exemplary offer/sell price title header 319 for an exemplary virtual transportation hub market;
Exemplary offer/sell quantity title header 326 for an exemplary virtual transportation hub market;
Exemplary bid/buy quantity 314 for the best bid quantity from a plurality of users 110 for an exemplary respective transportation capacity virtual hub combination 311;
Exemplary bid/buy quantity 313 for the second-best bid quantity from a plurality of users 110 for an exemplary respective transportation capacity virtual hub combination 311;
Exemplary bid/buy price 318 for the best bid price from a plurality of users 110 for an exemplary respective transportation capacity virtual hub combination 311;
Exemplary bid/buy price 317 for the second-best bid price from a plurality of users 110 for an exemplary respective transportation capacity virtual hub combination 311;
Exemplary offer/sell price 321 for the best offer price from a plurality of users 110 for an exemplary respective transportation capacity virtual hub combination 311;
Exemplary offer/sell price 320 for the second-best offer price from a plurality of users 110 for an exemplary respective transportation capacity virtual hub combination 311;
Exemplary offer/sell quantity 325 for the best offer quantity from a plurality of users 110 for an exemplary respective transportation capacity virtual hub combination 311;
Exemplary offer/sell quantity 324 for the second-best offer quantity from a plurality of users 110 for an exemplary respective transportation capacity virtual hub combination 311;
Exemplary safety dispatch “911” button 329 to enact video and audio recording of the user 110 environment and dispatch of that information to authorities.
Exemplary hamburger menu button 270 to move back to menu options and settings away from the participation, transaction, trading GUI 210 embodiment.
In some embodiments, the user 110 may enter a transaction quantity and price for transportation capacity units to participate, transact, and/or trade by the GUI 210 detecting user 110 contact with a bid/buy price 318 or offer/sell price 321. The GUI 210 detects user 110 contact with any of the GUI 210 buttons which have been aforementioned. Upon user 110 contact with buttons on the GUI 210, instructions are instantiated which allows the user 110 to change the specifications of the respective virtual hub combination 311. A plurality of prices and markets may be presented based on a plurality of contract specifications. In some embodiments, the best bid/buy price 318 may be moving up in price or down in price depending on the market conditions at any given time. In some embodiments, the last trade or last transacted price for a given specification is listed to help the user 110 understand how the market is moving so that the user 110 may submit a competitive offer/selling price 321 or bid/buying price 314. In some embodiments, users 110 may adjust settings of the GUI 210 to show more bid/buying prices 317 or more offer/selling prices 320. In some embodiments, the matrix of market quantities and prices 313, 314, 315, 316, 317, 318, 319, 320, 321, 324, 325, 326 may be referred to as market depth in the GUI 210 embodiment. In some embodiments, the number of users 110 may be displayed as user icons 312 or 323 for the amount of people logged who desire to transact, trade, or participate in a given virtual hub 310 to virtual hub 322 combination. In some embodiments, users 110 may select the transportation mode 330, such that the user allows a market for only one form of transportation capacity as a commodity, or the user 110 may allow the system to show multiple forms of transportation capacity between two virtual transportation capacity hubs 310, 311, 322. In some embodiments, the GUI 210 may detect a user 110 selecting the 911 button 329, which may activate voice and video recording functions on the mobile or stationary device 111 and transmit the data with a confirmation from the user 110 to the authorities to provide enhanced security while participating, transacting, or trading forward transportation as a commodity. In some embodiments, the user may toggle between the GUI 210 market view screen in
Exemplary virtual hub combination 411;
Exemplary virtual hub origin/from location 410 with users 412 within the virtual hub location 410;
Exemplary specification summary of the market, level of service and time of delivery commencement 427, in this particular embodiment the GUI 210 has moved to an international virtual market hub combination market such as London;
Exemplary mode of transportation capacity type 430;
Exemplary transaction summary of the last trades quantity and price 428 in the local currency or another currency set by the user 110;
Exemplary virtual hub destination/to location 422 and user who is being delivered on the transportation capacity unit 423;
Exemplary bid/buy quantity title header 415 for an exemplary virtual transportation hub market;
Exemplary bid/buy price title header 416 for an exemplary virtual transportation hub market;
Exemplary offer/sell price title header 419 for an exemplary virtual transportation hub market;
Exemplary offer/sell quantity title header 426 for an exemplary virtual transportation hub market;
Exemplary bid/buy quantity 414 for the best bid quantity from a plurality of users 110 for an exemplary respective transportation capacity virtual hub combination 411;
Exemplary bid/buy quantity 413 for the second-best bid quantity from a plurality of users 110 for an exemplary respective transportation capacity virtual hub combination 411;
Exemplary bid/buy price 418 for the best bid price from a plurality of users 110 for an exemplary respective transportation capacity virtual hub combination 411;
Exemplary bid/buy price 417 for the second-best bid price from a plurality of users 110 for an exemplary respective transportation capacity virtual hub combination 411;
Exemplary offer/sell price 421 for the best offer price from a plurality of users 110 for an exemplary respective transportation capacity virtual hub combination 411;
Exemplary offer/sell price 420 for the second-best offer price from a plurality of users 110 for an exemplary respective transportation capacity virtual hub combination 411;
Exemplary offer/sell quantity 425 for the best offer quantity from a plurality of users 110 for an exemplary respective transportation capacity virtual hub combination 411;
Exemplary offer/sell quantity 424 for the second-best offer quantity from a plurality of users 110 for an exemplary respective transportation capacity virtual hub combination 411;
Exemplary safety dispatch “911” button 429 to enact video and audio recording of the user 110 environment and dispatch of that information to authorities.
Exemplary hamburger menu button 270 to move back to menu options and settings away from the participation, transaction, trading GUI 210 embodiment.
In some embodiments, the user 110 may enter a transaction quantity and price for transportation capacity units to participate, transact, and/or trade by the GUI 210 detecting user 110 contact with a bid/buy price 418 or offer/sell price 421. The GUI 210 detects user 110 contact with any of the GUI 210 buttons which have been aforementioned. Upon user 110 contact with buttons on the GUI 210, instructions are instantiated which allows the user 110 to change the specifications of the respective virtual hub combination 411. A plurality of prices and markets may be presented based on a plurality of contract specifications. In some embodiments, the best bid/buy price 418 may be moving up in price or down in price depending on the market conditions at any given time. In some embodiments, the last trade or last transacted price for a given specification is listed to help the user 110 understand how the market is moving so that the user 110 may submit a competitive offer/selling price 421 or bid/buying price 414. In some embodiments, users 110 may adjust settings of the GUI 210 to show more bid/buying prices 417 or more offer/selling prices 420. In some embodiments, the matrix of market quantities and prices 413, 414, 415, 416, 417, 418, 419, 420, 421, 424, 425, 426 may be referred to as market depth in the GUI 210 embodiment. In some embodiments, the number of users 110 may be displayed as user icons 412 or 423 for the amount of people logged who desire to transact, trade, or participate in a given virtual hub 410 to virtual hub 422 combination. In some embodiments, users 110 may select the transportation mode 430, such that the user allows a market for only one form of transportation capacity as a commodity, or the user 110 may allow the system to show multiple forms of transportation capacity between two virtual transportation capacity hubs 410, 411, 422. In some embodiments, the GUI 210 may detect a user 110 selecting the 911 button 429, which may activate voice and video recording functions on the mobile or stationary device 111 and transmit the data with a confirmation from the user 110 to the authorities to provide enhanced security while participating, transacting, or trading forward transportation as a commodity. In some embodiments, the user may toggle between the GUI 210 market view screen in
In some embodiments, the user 110 may select a plurality of timing options in the timing selection specification 510. The timing specification constraint may be the time at which the transportation capacity unit departs from the origin/from virtual hub 410. As in any commodity market, if a user 110 is late and they have purchased the transportation capacity unit, the user must still pay for the transportation capacity unit regardless if the user 110 is present at the time of departure or not. The user has the option if they know they will be late to sell back the transportation capacity unit to the market at the then current price. Accordingly, for the purpose of example, but not limiting by example, if a user 110 bought a transportation capacity unit for £9.90 421 and the user 110 realized they would be late for the 8 am departure specification 427, then the user 110 may either pay for the transportation unit even though the user 110 was present and did not take delivery of the transportation unit, or the user 110 may preemptively sell back the transportation capacity unit to the market at the then current bid price 418. The user 110 would then have offset their obligation in a timely manner and another user 110 on the network 140, 160 may then purchase the available transportation capacity unit. In some embodiments, virtual transportation hub combination units may or may not have the available liquidity if the user 110 were to wait too long before delivery of the transportation capacity unit to make an adjustment and therefore may need to take delivery even if they are not present. In some embodiments, the user 110 may select a grade specification 520. For the purpose of example, but not limiting by example, a plurality of specification grades may exist, such as “premium”, which may be defined by certain classes of transportation capacity units and/or certain quality levels. Similarly, for the purpose of example, but not limiting by example, a plurality of specification grades may exist such as “intermediate” or “basic” which may be defined by certain classes of transportation capacity units and/or certain quality levels. In some embodiments, the user 110 may select the destination/to virtual hub 530 to change the virtual hub combination. In some embodiments, the user 110 may contact the “set” button 540 to transmit the transportation capacity unit specification data by using the GUI 210 which may instantiate instructions in the memory of the mobile computing device 111 which then transmits transportation capacity data through the network 140 or wireless GPS network 150 to call upon instruction routines and instruction sub-routines on the transportation exchange database server 130, virtual hub database server 120, network member database server 160, no arbitrage condition database server 180, and/or instructions in the memory of the cloud and local CPUs 190, which all interface together to make one system that may deliver transportation capacity units to users 110 from and to a plurality of virtual hubs 410, 422 with a plurality of specifications at specific market prices.
In some embodiments, the term specification 610 may be used to participate, transact, and/or trade in a specific virtual hub combination for a specific time period specification. Users 110 may set the term to daily, weekly, monthly, annual, weekdays, weekends, specific days, such as Monday, Tuesday, Wednesday, Thursday, Friday, Saturday, Sunday, or any combination of term selections the user 110 sets as relevant for participating, transacting, or trading in the transportation capacity unit market. Not limiting by example, but for use of illustrating a possible subset of term selections, the user 110 may select “weekdays” 610 during a specific calendar time period 650 of a given year. In some embodiments, specific time start dates and end dates may be set by the user with the calendar button 650. In some embodiments a user 110 may select “Mondays” 610 within a specification date window 650. In some embodiments, the user 110 may select “weekends” 610 during a specification calendar window of dates 650. In some embodiments, the user 110 may contact the “set” button 640 to transmit the transportation capacity unit specification data by using the GUI 210 which may instantiate instructions in the memory of the mobile computing device 111 which then transmits transportation capacity data through the network 140 or wireless GPS network 150 to call upon instruction routines and instruction sub-routines on the transportation exchange database server 130, virtual hub database server 120, network member database server 160, no arbitrage condition database server 180, and/or instructions in the memory of the cloud and local CPUs 190, which all interface together to make one system that may deliver transportation capacity units to users 110 from and to a plurality of virtual hubs 410, 422 with a plurality of specifications at specific market prices.
In some embodiments, user interface 210 may be used by the user 110 to select a plurality of order time in force specifications 710. In some embodiments, order time in force selections 710 may include a subset or superset thereof: day (DAY) order; good till cancelled order (GTC); immediate or cancel order (100), good till date order (GTD); and day till cancelled order (DTC). Order time in force specifications 710 may be used to designate how long a user 110 order may be valid. In some embodiments, the GUI 210 may display the definitions of a plurality of order time in force specification 710 characteristics, so that the user 110 may select the appropriate order time in force specification 710 for the transportation capacity unit that the user 110 may participate, transact, and/or trade. In some embodiments, the user interface 210 may be used to select the order type specifications 720. In some embodiments, order type selections 720 may include a subset or superset thereof: Limit, Market, Market if Touched (MIT); Snap to Market; Snap to Mid; Snap to primary; Peg to benchmark; and adaptive custom. In some embodiments, the GUI 210 may display the definitions of a plurality of order types specification 720 characteristics, so that the user 110 may select the appropriate order type specification 720 for the transportation capacity unit that the user 110 may participate, transact, and/or trade. In some embodiments, the user 110 may contact the “set” button 740 to transmit the transportation capacity unit specification data by using the GUI 210, which may instantiate instructions in the memory of the mobile computing device 111, which then transmits transportation capacity data through the network 140 or wireless GPS network 150 to call upon instruction routines and instruction sub-routines on the transportation exchange database server 130, virtual hub database server 120, network member database server 160, no arbitrage condition database server 180 and/or instructions in the memory of the cloud and local CPUs 190, which all interface together to make one system that may deliver transportation capacity units to users 110 from and to a plurality of virtual hubs 410, 422 with a plurality of specifications at specific market prices.
In some embodiments, user interface 210 may be used by the user 110 to select a plurality of virtual hub transportation capacity unit modes 810 specifications. In some embodiments, virtual hub transportation capacity unit mode selections 810 may include a subset or superset thereof: automobile 811; air 812; autonomous vehicle 813; bike 814; boat 815; bus 816; drone 817; limo 818; motorcycle 819; moped 820; shuttle 821; space 822; subway 823; taxi 824; train 825; fastest optimized 826; cheapest route 827; packages 828; cargo 829; and virtual 830. In some embodiments, virtual hub transportation capacity unit modes are simply that a user 110 would have a virtual transportation capacity unit seat in an automobile or an airplane as examples, but not limiting by example. In some embodiments, the user 110 may bid on cargo 829 or package capacity 828 in any mode of transportation capacity between a combination of virtual transportation hub locations. In some embodiments, the user 110 may use one or multiple modes of transportation between a combination of virtual transportation hub capacity points. In some embodiments, the user 110 may contact the “set” button 840 to transmit the transportation capacity unit specification mode data by using the GUI 210, which may instantiate instructions in the memory of the mobile computing device 111, which then transmits transportation capacity data through the network 140 or wireless GPS network 150 to call upon instruction routines and instruction sub-routines on the transportation exchange database server 130, virtual hub database server 120, network member database server 160, no arbitrage condition database server 180, and/or instructions in the memory of the cloud and local CPUs 190, which all interface together to make one system that may deliver transportation capacity units to users 110 from and to a plurality of virtual hubs 410, 422 with a plurality of specifications at specific market prices.
In some embodiments, user interface 210 may be used by the user 110 to select a plurality of virtual hub transportation capacity unit address 910 specifications. In some embodiments, virtual hub transportation capacity unit address selections 910 may include a subset or superset thereof: virtual hub pick up address 920; virtual hub drop off address 930. In some embodiments, virtual hub transportation capacity unit addresses 920 and 930 may be changed before delivery of a virtual transportation capacity unit. The user interface map and address tool 910 displays the users 110 distance from the address of the virtual transportation hub as well as a map to assist the user 110 in finding the location of the virtual transportation hub. In some embodiments, user interface 210 displays the virtual hub pick up zone 960 on a map in context to the user's 110 location. In some embodiments, user interface 210 displays the virtual hub drop off zone 950 on a map in context to the user's 110 location. In some embodiments, the user 110 may contact the “set” button 940 to transmit the transportation capacity unit specification address data by using the GUI 210, which may instantiate instructions in the memory of the mobile computing device 111, which then transmits transportation capacity data through the network 140 or wireless GPS network 150 to call upon instruction routines and instruction sub-routines on the transportation exchange database server 130, virtual hub database server 120, network member database server 160, no arbitrage condition database server 180, and/or instructions in the memory of the cloud and local CPUs 190, which all interface together to make one system that may deliver transportation capacity units to users 110 from and to a plurality of virtual hubs 410, 422 with a plurality of specifications at specific market prices.
In some embodiments, user interface 210 may be used by the user 110 to select a plurality of virtual hub transportation capacity constraint and no arbitrage settings 1010. In some embodiments, virtual hub transportation capacity unit constraint and no arbitrage selections 1010 may include a subset or superset thereof: cheapest route 1011; single mode 1012; multi-mode 1013; fastest route 1014; most scenic 1015; highest rating 1016; most available 1017; highest volume 1018; most frequent 1019; service level 1020; and security and safety 1021. In some embodiments, the “cheapest route setting” 1011 instantiates instructions in the memory of the CPU 190 to complete a standard cost minimization linear program to assist the user 110 to complete the transportation capacity unit between two virtual hubs with the lowest cost. In some embodiments, the “single mode” 1012 instantiates instructions in the memory of the CPU 190 to set a constraint for the user 110 to complete the transportation capacity unit between two virtual hubs with the only one mode of transportation. In some embodiments, the “multi mode” 1013 instantiates instructions in the memory of the CPU 190 to set a constraint for the user 110 to complete the transportation capacity unit between two virtual hubs with more than one mode of transportation. In some embodiments, the “fastest route” 1014 instantiates instructions in the memory of the CPU 190 to complete standard linear programming equation to minimize travel time for the user 110 to complete the transportation capacity unit between two virtual hubs with the shortest time. In some embodiments, the “most scenic” 1015 instantiates instructions in the memory of the CPU 190 to complete an algorithm with the highest ratings for scenery to assist the user 110 to complete the transportation capacity unit between two virtual hubs with highest scenery rating. In some embodiments, the “highest rating” 1016 instantiates instructions in the memory of the CPU 190 to complete a rating algorithm to assist the user 110 to complete the transportation capacity unit between two virtual hubs with the highest rating. In some embodiments, the “most available” 1017 instantiates instructions in the memory of the CPU 190 to complete an algorithm to search for the route with the most open transportation capacity units to assist the user 110 to complete the transportation capacity unit between two virtual hubs with the most available open seats or open transportation capacity units. In some embodiments, the “highest volume” 1018 instantiates instructions in the memory of the CPU 190 to complete an algorithm to select the route with the highest volume of participants to assist the user 110 to complete the transportation capacity unit between two virtual hubs with the largest number of users 110. In some embodiments, the “most frequent” 1019 instantiates instructions in the memory of the CPU 190 to complete most frequent route analysis from a timing constraint perspective to assist the user 110 to complete the transportation capacity unit between two virtual hubs with the most frequent departures. In some embodiments, the “service level” 1020 instantiates instructions in the memory of the CPU 190 to align the constraint to select the service level to assist the user 110 to complete the transportation capacity unit between two virtual hubs with the correct level of service. In some embodiments, the “security and safety” 1021 instantiates instructions in the memory of the CPU 190 to run safety and security algorithms on the user's 110 based on block chain performance of drivers and riders to assist the user 110 to complete the transportation capacity unit between two virtual hubs with the highest level of safety and security. In some embodiments, the user 110 may contact the “set” button 1040 to transmit the transportation capacity unit specification constraint and arbitrage data by using the GUI 210, which may instantiate instructions in the memory of the mobile computing device 111, which then transmits transportation capacity security and safety data through the network 140 or wireless GPS network 150 to call upon instruction routines and instruction sub-routines on the transportation exchange database server 130, virtual hub database server 120, network member database server 160, no arbitrage condition database server 180, and/or instructions in the memory of the cloud and local CPUs 190, which all interface together to make one system that may deliver transportation capacity units to users 110 from and to a plurality of virtual hubs 410, 422 with a plurality of specifications at specific market prices.
In some embodiments, the user 110 may enter a transaction quantity and price for transportation capacity units to participate, transact, and/or trade by the GUI 210 detecting user 110 contact with a bid/buy price 1118 or offer/sell price 1121. The GUI 210 detects user 110 contact with any of the GUI 210 buttons which have been aforementioned. Upon user 110 contact with buttons on the GUI 210, instructions are instantiated which allows the user 110 to change the specifications of the respective virtual hub combination 1111. A plurality of prices and markets may be presented based on a plurality of contract specifications. In some embodiments, the best bid/buy price 1118 may be moving up in price or down in price depending on the market conditions at any given time. In some embodiments, the last trade or last transacted price for a given the user 110 may submit a competitive offer/selling price 1121 or bid/buying price 1114. In some embodiments, users 110 may adjust settings of the GUI 210 to show more bid/buying prices 1117 or more offer/selling prices 1120. In some embodiments, the matrix of market quantities and prices 1113, 1114, 1115, 1116, 1117, 1118, 1119, 1120, 1121, 1124, 1125, 1126 may be referred to as market depth in the GUI 210 embodiment. In some embodiments, the number of users 110 may be displayed as user icons 1112 or 1123 for the amount of people logged who desire to transact, trade, or participate in a given virtual hub 1110 to virtual hub 1122 combination. In some embodiments, users 110 may select the transportation mode 1130, such that the user allows a market for only one form of transportation capacity as a commodity, or the user 110 may allow the system to show multiple forms of transportation capacity between two virtual transportation capacity hubs 1110, 1111, 1122. In some embodiments, the GUI 210 may detect a user 110 selecting the 911 button 1129, which may activate voice and video recording functions on the mobile or stationary device 111 and transmit the data with a confirmation from the user 110 to the authorities to provide enhanced security while participating, transacting, or trading forward transportation as a commodity. In some embodiments, the user may toggle between the GUI 210 market view screen in
Exemplary virtual hub combination 1211;
Exemplary virtual hub origin/from location 1210 with users 1212 within the virtual hub location 1210;
Exemplary specification summary of the market, level of service and time of delivery commencement 1227;
Exemplary mode of transportation capacity type 1230;
Exemplary transaction summary of the last trades quantity and price 1228;
Exemplary virtual hub destination/to location 1222 and user who is being delivered on the transportation capacity unit 1223;
Exemplary bid/buy quantity title header 1215 for an exemplary virtual transportation hub market;
Exemplary bid/buy price title header 1216 for an exemplary virtual transportation hub market;
Exemplary offer/sell price title header 1219 for an exemplary virtual transportation hub market;
Exemplary offer/sell quantity title header 1226 for an exemplary virtual transportation hub market;
Exemplary bid/buy quantity 1214 for the best bid quantity from a plurality of users 110 for an exemplary respective transportation capacity virtual hub combination 1111;
Exemplary bid/buy quantity 1213 for the second-best bid quantity from a plurality of users 110 for an exemplary respective transportation capacity virtual hub combination 1211;
Exemplary bid/buy price 1218 for the best bid price from a plurality of users 110 for an exemplary respective transportation capacity virtual hub combination 1211;
Exemplary bid/buy price 1217 for the second-best bid price from a plurality of users 110 for an exemplary respective transportation capacity virtual hub combination 1211;
Exemplary offer/sell price 1221 for the best offer price from a plurality of users 110 for an exemplary respective transportation capacity virtual hub combination 1211;
Exemplary offer/sell price 1220 for the second-best offer price from a plurality of users 110 for an exemplary respective transportation capacity virtual hub combination 1211;
Exemplary offer/sell quantity 1225 for the best offer quantity from a plurality of users 110 for an exemplary respective transportation capacity virtual hub combination 1211;
Exemplary offer/sell quantity 1224 for the second-best offer quantity from a plurality of users 110 for an exemplary respective transportation capacity virtual hub combination 1211;
Exemplary safety dispatch “911” button 1229 to enact video and audio recording of the user 110 environment and dispatch of that information to authorities.
Exemplary hamburger menu button 270 to move back to menu options and settings away from the participation, transaction, trading GUI 210 embodiment.
In some embodiments, the user 110 may enter a transaction quantity and price for transportation capacity units to participate, transact, and/or trade by the GUI 210 detecting user 110 contact with a bid/buy price 1218 or offer/sell price 1221. The GUI 210 detects user 110 contact with any of the GUI 210 buttons which have been aforementioned. Upon user 110 contact with buttons on the GUI 210, instructions are instantiated which allows the user 110 to change the specifications of the respective virtual hub combination 1211. A plurality of prices and markets may be presented based on a plurality of contract specifications. In some embodiments, the best bid/buy price 1218 may be moving up in price or down in price depending on the market conditions at any given time. In some embodiments, the last trade or last transacted price for a given the user 110 may submit a competitive offer/selling price 1221 or bid/buying price 1214. In some embodiments, users 110 may adjust settings of the GUI 210 to show more bid/buying prices 1217 or more offer/selling prices 1120. In some embodiments, the matrix of market quantities and prices 1213, 1214, 1215, 1216, 1217, 1218, 1219, 1220, 1221, 1224, 1225, 1226 may be referred to as market depth in the GUI 210 embodiment. In some embodiments, the number of users 110 may be displayed as user icons 1212 or 1223 for the amount of people logged who desire to transact, trade, or participate in a given virtual hub 1210 to virtual hub 1222 combination. In some embodiments, users 110 may select the transportation mode 1230, such that the user allows a market for only one form of transportation capacity as a commodity, or the user 110 may allow the system to show multiple forms of transportation capacity between two virtual transportation capacity hubs 1210, 1211, 1222. In some embodiments, the GUI 210 may detect a user 110 selecting the 911 button 1229, which may activate voice and video recording functions on the mobile or stationary device 111 and transmit the data with a confirmation from the user 110 to the authorities to provide enhanced security while participating, transacting, or trading forward transportation as a commodity. In some embodiments, the user may toggle between the GUI 210 market view screen in
Exemplary virtual hub combination 1311;
Exemplary virtual hub origin/from location 1310 with users 1312 within the virtual hub location 1310;
Exemplary specification summary of the market, level of service and time of delivery commencement 1327;
Exemplary mode of transportation capacity type 1330;
Exemplary transaction summary of the last trades quantity and price 1328;
Exemplary virtual hub destination/to location 1322 and user who is being delivered on the transportation capacity unit 1323;
Exemplary bid/buy quantity title header 1315 for an exemplary virtual transportation hub market;
Exemplary bid/buy price title header 1316 for an exemplary virtual transportation hub market;
Exemplary offer/sell price title header 1319 for an exemplary virtual transportation hub market;
Exemplary offer/sell quantity title header 1326 for an exemplary virtual transportation hub market;
Exemplary bid/buy quantity 1314 for the best bid quantity from a plurality of users 110 for an exemplary respective transportation capacity virtual hub combination 1311;
Exemplary bid/buy quantity 1313 for the second-best bid quantity from a plurality of users 110 for an exemplary respective transportation capacity virtual hub combination 1311;
Exemplary bid/buy price 1318 for the best bid price from a plurality of users 110 for an exemplary respective transportation capacity virtual hub combination 1311;
Exemplary bid/buy price 1317 for the second-best bid price from a plurality of users 110 for an exemplary respective transportation capacity virtual hub combination 1311;
Exemplary offer/sell price 1321 for the best offer price from a plurality of users 110 for an exemplary respective transportation capacity virtual hub combination 1311;
Exemplary offer/sell price 1320 for the second-best offer price from a plurality of users 110 for an exemplary respective transportation capacity virtual hub combination 1311;
Exemplary offer/sell quantity 1325 for the best offer quantity from a plurality of users 110 for an exemplary respective transportation capacity virtual hub combination 1311;
Exemplary offer/sell quantity 1324 for the second-best offer quantity from a plurality of users 110 for an exemplary respective transportation capacity virtual hub combination 1311;
Exemplary safety dispatch “911” button 1329 to enact video and audio recording of the user 110 environment and dispatch of that information to authorities.
Exemplary hamburger menu button 270 to move back to menu options and settings away from the participation, transaction, trading GUI 210 embodiment.
In some embodiments, the user 110 may enter a transaction quantity and price for transportation capacity units to participate, transact, and/or trade by the GUI 210 detecting user 110 contact with a bid/buy price 1318 or offer/sell price 1321. The GUI 210 detects user 110 contact with any of the GUI 210 buttons which have been aforementioned. Upon user 110 contact with buttons on the GUI 210, instructions are instantiated which allows the user 110 to change the specifications of the respective virtual hub combination 1311. A plurality of prices and markets may be presented based on a plurality of contract specifications. In some embodiments, the best bid/buy price 1318 may be moving up in price or down in price depending on the market conditions at any given time. In some embodiments, the last trade or last transacted price for a given the user 110 may submit a competitive offer/selling price 1321 or bid/buying price 1314. In some embodiments, users 110 may adjust settings of the GUI 210 to show more bid/buying prices 1317 or more offer/selling prices 1320. In some embodiments, the matrix of market quantities and prices 1313, 1314, 1315, 1316, 1317, 1318, 1319, 1320, 1321, 1324, 1325, 1326 may be referred to as market depth in the GUI 210 embodiment. In some embodiments, the number of users 110 may be displayed as user icons 1312 or 1323 for the amount of people logged who desire to transact, trade, or participate in a given virtual hub 1310 to virtual hub 1322 combination. In some embodiments, users 110 may select the transportation mode 1330, such that the user allows a market for only one form of transportation capacity as a commodity, or the user 110 may allow the system to show multiple forms of transportation capacity between two virtual transportation capacity hubs 1310, 1311, 1322. In some embodiments, the GUI 210 may detect a user 110 selecting the 911 button 1329, which may activate voice and video recording functions on the mobile or stationary device 111 and transmit the data with a confirmation from the user 110 to the authorities to provide enhanced security while participating, transacting, or trading forward transportation as a commodity. In some embodiments, the user may toggle between the GUI 210 market view screen in
Menu options 1410;
Origin (From)/Destination (to) menu option 1411; Market menu option 1412;
Timings and Specs menu option 1413;
Term and Specs menu option 1414;
Order time and type menu option 1415;
Modes menu option 1416;
Virtual Hubs menu option 1417;
No arb settings menu option 1418;
Orders and Confirms menu option 1419;
Pool Message menu option 1420;
Tax and Accounting menu option 1421;
Setting button 1440 to transmit the menu option;
Hamburger button 270 to instruct the GUI 210 to take the user 110 to the menu screen.
In some embodiments, user interface 210 may be used by the user 110 to select a plurality of menu options 1410. In some embodiments, the user 110 may select the origin (from)/destination (to) menu option 1411 which may instruct the GUI 210 to go to an address input rendering 910 and/or
Wireless global positioning system (GPS) network 1510;
Network 1511;
Additional global positioning system (GPS) network 1512;
User member portable multifunction device 1513;
Virtual hub database server 1514;
Transportation exchange database server 1519;
Additional user member portable multifunction device 1515;
Network member database server 1520;
Network member user 1516;
Additional network member user 1517;
No arbitrage constraint database server 1521;
Cloud and Local CPUs 1522; Transportation capacity unit mode 1518.
In some embodiments, the software and/or instructions stored in memory of the cloud & local CPUs 1522 and portable multifunction devices 1513, 1515 may include additional instructions to instantiate specification requirements, participation, transactions, and/or trading on the transportation capacity unit network 1511. In some embodiments, instructions may include standard database web services with the database as service provider (i.e., calling from the outside in), which lets the client GUI 210 or 1513 call each of the virtual hub database server 1514, transportation exchange database server 1519, network member database server 1520, no arbitrage constraint database server 1521, and/or cloud & local CPUs 1522 through the wireless GPS network 1510 or network 1511. In some embodiments, each of the virtual hub database server 1514, transportation exchange database server 1519, network member database server 1520, no arbitrage constraint database server 1521, and/or cloud & local CPUs 1522 may instruct the network to instantiate the database servers 1514, 1519, 1520, 1521, 1522 as service consumers (i.e., calling from the inside out), which lets an SQL query or application module in the database session consume an external web service. In some embodiments, users 1516 and/or 1517 may use portable multifunction devices 1513 and/or 1515 (e.g., mobile computing devices) to access the transportation capacity unit market GUI 210 so that the users 1516 and/or 1517 may participate, transact, and/or trade transportation capacity units. In some embodiments, the virtual hub database server 1514 stores map tile data in addition to user location data, which is utilized by the GUI 210 to display or render location of virtual hubs and user 1516 proximity to those virtual hubs discussed above with respect to
In some embodiments, the GUI 210 may be used to select, store, and/or edit user 110 frequent or preferred routes (“MY ROUTES”) 1710 for more efficient access to transportation capacity unit markets over various modes and specifications of transportation capacity. In some embodiments, the user 110 may select, store, and/or edit address and specification data for “Home to Work” 1711, “Work to Home” 1712, “Home to School” 1713, “School to Home” 1714, “Work to Gym” 1715, “Home to Gym” 1716, “Gym to Home” 1717, “Home to Grocery” 1718, “Home to Downtown” 1719, “Downtown to Home” 1720, “Work to Downtown” 1721, and/or “+ Add Route” 1722. In some embodiments, the My Routes 1710 module may include any route a user 110 may request on any transportation capacity unit mode and/or specification.
The aforementioned description, for purpose of explanation, has been described with reference to specific embodiments. However, the illustrative discussions above are not intended to be exhaustive or to limit the invention to the precise forms disclosed. Many modifications and variations are possible in view of the above teachings. The embodiments were chosen and described in order to best explain the principles of the invention and its practical applications, to thereby enable others skilled in the art to best utilize the invention and various embodiments with various modifications as are suited to the particular use contemplated.
Number | Name | Date | Kind |
---|---|---|---|
D209710 | Bruce | Dec 1967 | S |
4476954 | Johnson et al. | Oct 1984 | A |
D318073 | Jang | Jul 1991 | S |
5249259 | Harvey | Sep 1993 | A |
5412560 | Dennison | May 1995 | A |
5604676 | Penzias | Feb 1997 | A |
5726885 | Klein et al. | Mar 1998 | A |
5751245 | Klein et al. | Mar 1998 | A |
5973619 | Paredes | Oct 1999 | A |
6175831 | Weinreich et al. | Jan 2001 | B1 |
6240396 | Walker et al. | May 2001 | B1 |
6285999 | Page | Sep 2001 | B1 |
D453945 | Shan | Feb 2002 | S |
6356838 | Paul | Mar 2002 | B1 |
6400996 | Hoffberg | Jun 2002 | B1 |
D460952 | Kataoka | Jul 2002 | S |
6421606 | Asai et al. | Jul 2002 | B1 |
6434530 | Sloane et al. | Aug 2002 | B1 |
D468738 | Lin | Jan 2003 | S |
D469089 | Lin | Jan 2003 | S |
6609103 | Kolls | Aug 2003 | B1 |
6618062 | Brown et al. | Sep 2003 | B1 |
6646659 | Brown et al. | Nov 2003 | B1 |
6663564 | Miller-Kovach et al. | Dec 2003 | B2 |
6708879 | Hunt | Mar 2004 | B2 |
6850907 | Lutnick et al. | Feb 2005 | B2 |
7090638 | Vidgen | Aug 2006 | B2 |
7373320 | Mcdonough | May 2008 | B1 |
D590396 | Lo | Apr 2009 | S |
7584123 | Karonis et al. | Sep 2009 | B1 |
7634442 | Alvarado et al. | Dec 2009 | B2 |
7680690 | Catalano | Mar 2010 | B1 |
7680770 | Buyukkokten et al. | Mar 2010 | B1 |
7711629 | Laurent et al. | May 2010 | B2 |
7747739 | Bridges et al. | Jun 2010 | B2 |
7756633 | Huang et al. | Jul 2010 | B2 |
7788207 | Alcorn et al. | Aug 2010 | B2 |
D628171 | Hakopian | Nov 2010 | S |
7886166 | Shnekendorf et al. | Feb 2011 | B2 |
D638879 | Suto | May 2011 | S |
7987110 | Cases et al. | Jul 2011 | B2 |
8024234 | Thomas et al. | Sep 2011 | B1 |
8065191 | Senior | Nov 2011 | B2 |
D650385 | Chiu | Dec 2011 | S |
8121780 | Gerdes et al. | Feb 2012 | B2 |
8249946 | Froseth et al. | Aug 2012 | B2 |
8296335 | Bouve et al. | Oct 2012 | B2 |
8388451 | Auterio et al. | Mar 2013 | B2 |
8570244 | Mukawa | Oct 2013 | B2 |
8762035 | Levine et al. | Jun 2014 | B2 |
8798593 | Brown et al. | Aug 2014 | B2 |
8918411 | Latif et al. | Dec 2014 | B1 |
8920175 | Black et al. | Dec 2014 | B2 |
8930490 | Brown et al. | Jan 2015 | B2 |
8968099 | Hanke et al. | Mar 2015 | B1 |
9011153 | Bennett et al. | Apr 2015 | B2 |
9020763 | Faaborg et al. | Apr 2015 | B2 |
9077204 | More et al. | Jul 2015 | B2 |
9092826 | Deng et al. | Jul 2015 | B2 |
9159088 | Dillahunt et al. | Oct 2015 | B2 |
9213957 | Stefik et al. | Dec 2015 | B2 |
9274540 | Anglin et al. | Mar 2016 | B2 |
9292764 | Yun et al. | Mar 2016 | B2 |
9387928 | Gentry et al. | Jul 2016 | B1 |
9389090 | Levine et al. | Jul 2016 | B1 |
9389094 | Brenner et al. | Jul 2016 | B2 |
9410963 | Martin et al. | Aug 2016 | B2 |
9436923 | Sriram et al. | Sep 2016 | B1 |
D772828 | Kusumoto | Nov 2016 | S |
9528972 | Minvielle | Dec 2016 | B2 |
9558515 | Babu et al. | Jan 2017 | B2 |
9665983 | Spivack | May 2017 | B2 |
9880577 | Dyess et al. | Jan 2018 | B2 |
9952042 | Abovitz et al. | Apr 2018 | B2 |
9960637 | Sanders et al. | May 2018 | B2 |
9978282 | Lambert et al. | May 2018 | B2 |
10082793 | Glaser | Sep 2018 | B1 |
D832355 | Castro | Oct 2018 | S |
10262289 | Vaananen | Apr 2019 | B2 |
10395332 | Konrardy et al. | Aug 2019 | B1 |
10403050 | Beall et al. | Sep 2019 | B1 |
10460520 | Simpson et al. | Oct 2019 | B2 |
10533850 | Abovitz et al. | Jan 2020 | B2 |
10586084 | Burch et al. | Mar 2020 | B2 |
10685503 | Ricci | Jun 2020 | B2 |
10737585 | Chaudhary et al. | Aug 2020 | B2 |
D896315 | Castro | Sep 2020 | S |
10832337 | Floyd et al. | Nov 2020 | B1 |
10872381 | Leise et al. | Dec 2020 | B1 |
D910758 | Leong | Feb 2021 | S |
11035682 | Simpson | Jun 2021 | B2 |
11138827 | Simpson | Oct 2021 | B2 |
D938375 | Zhang | Dec 2021 | S |
11215466 | Simpson | Jan 2022 | B2 |
11288563 | Lee et al. | Mar 2022 | B2 |
11296897 | Endress et al. | Apr 2022 | B2 |
11298017 | Tran | Apr 2022 | B2 |
11298591 | Evancha | Apr 2022 | B2 |
11537953 | Beaurepaire | Dec 2022 | B2 |
11555709 | Simpson | Jan 2023 | B2 |
11586993 | Handler et al. | Feb 2023 | B2 |
D980210 | Wu | Mar 2023 | S |
11651464 | Park | May 2023 | B2 |
D993316 | Lin | Jul 2023 | S |
11734618 | Ogden | Aug 2023 | B2 |
D1000137 | Shuster | Oct 2023 | S |
D1007451 | Im | Dec 2023 | S |
D1024065 | Kim | Apr 2024 | S |
20020004788 | Gros et al. | Jan 2002 | A1 |
20020013718 | Cornwell | Jan 2002 | A1 |
20020013761 | Bundy | Jan 2002 | A1 |
20020017997 | Wall | Feb 2002 | A1 |
20020065738 | Riggs et al. | May 2002 | A1 |
20020065766 | Brown et al. | May 2002 | A1 |
20020128952 | Melkomaian | Sep 2002 | A1 |
20020133456 | Lancaster et al. | Sep 2002 | A1 |
20020161689 | Segal | Oct 2002 | A1 |
20030055776 | Samuelson | Mar 2003 | A1 |
20030191725 | Ratliff et al. | Oct 2003 | A1 |
20030233311 | Bramnick et al. | Dec 2003 | A1 |
20040019552 | Tobin | Jan 2004 | A1 |
20040115596 | Snyder et al. | Jun 2004 | A1 |
20040249742 | Laurent | Dec 2004 | A1 |
20040260581 | Baranowski et al. | Dec 2004 | A1 |
20050021346 | Nadan et al. | Jan 2005 | A1 |
20050027637 | Kohler | Feb 2005 | A1 |
20050132070 | Redlich et al. | Jun 2005 | A1 |
20050288974 | Baranowski et al. | Dec 2005 | A1 |
20050288986 | Barts et al. | Dec 2005 | A1 |
20060104224 | Singh | May 2006 | A1 |
20070005224 | Sutardja | Jan 2007 | A1 |
20080033833 | Senior | Feb 2008 | A1 |
20080040232 | Perchthaler | Feb 2008 | A1 |
20080077309 | Cobbold | Mar 2008 | A1 |
20080129490 | Linville et al. | Jun 2008 | A1 |
20080140557 | Bowlby et al. | Jun 2008 | A1 |
20080157990 | Belzer et al. | Jul 2008 | A1 |
20080195432 | Fell et al. | Aug 2008 | A1 |
20080262892 | Prager et al. | Oct 2008 | A1 |
20090221338 | Stewart | Sep 2009 | A1 |
20090231687 | Yamamoto | Sep 2009 | A1 |
20090271236 | Ye et al. | Oct 2009 | A1 |
20090275002 | Hoggle | Nov 2009 | A1 |
20090276154 | Subramanian et al. | Nov 2009 | A1 |
20090287401 | Levine et al. | Nov 2009 | A1 |
20090309729 | Nichols | Dec 2009 | A1 |
20100042421 | Bai et al. | Feb 2010 | A1 |
20100081548 | Labedz | Apr 2010 | A1 |
20100114790 | Strimling et al. | May 2010 | A1 |
20100191834 | Zampiello | Jul 2010 | A1 |
20100211441 | Sprigg et al. | Aug 2010 | A1 |
20100217680 | Fusz et al. | Aug 2010 | A1 |
20100228574 | Mundinger et al. | Sep 2010 | A1 |
20100280748 | Mundinger et al. | Nov 2010 | A1 |
20100280884 | Levine et al. | Nov 2010 | A1 |
20100306078 | Hwang | Dec 2010 | A1 |
20110025267 | Kamen et al. | Feb 2011 | A1 |
20110059693 | O'Sullivan | Mar 2011 | A1 |
20110098056 | Rhoads et al. | Apr 2011 | A1 |
20110106660 | Bai et al. | May 2011 | A1 |
20110202418 | Kempton et al. | Aug 2011 | A1 |
20120023032 | Visdomini | Jan 2012 | A1 |
20120075067 | Attaluri | Mar 2012 | A1 |
20120078743 | Betancourt | Mar 2012 | A1 |
20120101629 | Olsen et al. | Apr 2012 | A1 |
20120158762 | IwuchukWu | Jun 2012 | A1 |
20120303259 | Prosser | Nov 2012 | A1 |
20120323645 | Spiegel et al. | Dec 2012 | A1 |
20130024041 | Golden et al. | Jan 2013 | A1 |
20130132261 | Ebersole | May 2013 | A1 |
20130147820 | Kalai et al. | Jun 2013 | A1 |
20130173326 | Anglin et al. | Jul 2013 | A1 |
20130179205 | Slinin | Jul 2013 | A1 |
20130191237 | Tenorio | Jul 2013 | A1 |
20130211863 | White | Aug 2013 | A1 |
20130265174 | Scofield et al. | Oct 2013 | A1 |
20130268325 | Dembo | Oct 2013 | A1 |
20130275156 | Kinkaid et al. | Oct 2013 | A1 |
20130304522 | Cundle | Nov 2013 | A1 |
20130311264 | Solomon et al. | Nov 2013 | A1 |
20140038781 | Foley | Feb 2014 | A1 |
20140075528 | Matsuoka | Mar 2014 | A1 |
20140098009 | Prest et al. | Apr 2014 | A1 |
20140122190 | Wolfson et al. | May 2014 | A1 |
20140129302 | Amin et al. | May 2014 | A1 |
20140149157 | Shaam et al. | May 2014 | A1 |
20140162598 | Villa-Real | Jun 2014 | A1 |
20140180732 | Rotchin | Jun 2014 | A1 |
20140220516 | Marshall et al. | Aug 2014 | A1 |
20140229258 | Seriani | Aug 2014 | A1 |
20140236641 | Dawkins | Aug 2014 | A1 |
20140244413 | Senior | Aug 2014 | A1 |
20140310019 | Blander et al. | Oct 2014 | A1 |
20140310149 | Singh | Oct 2014 | A1 |
20140324633 | Pollak et al. | Oct 2014 | A1 |
20140349672 | Kern et al. | Nov 2014 | A1 |
20150006428 | Miller et al. | Jan 2015 | A1 |
20150016777 | Abovitz et al. | Jan 2015 | A1 |
20150058051 | Movshovich | Feb 2015 | A1 |
20150097864 | Alaniz | Apr 2015 | A1 |
20150154516 | Joachim | Jun 2015 | A1 |
20150161564 | Sweeney et al. | Jun 2015 | A1 |
20150178642 | Abboud | Jun 2015 | A1 |
20150198459 | MacNeille et al. | Jul 2015 | A1 |
20150206443 | Aylesworth et al. | Jul 2015 | A1 |
20150220916 | Prakash et al. | Aug 2015 | A1 |
20150241236 | Slusar et al. | Aug 2015 | A1 |
20150248689 | Paul et al. | Sep 2015 | A1 |
20150260474 | Rublowsky et al. | Sep 2015 | A1 |
20150269865 | Volach et al. | Sep 2015 | A1 |
20150324831 | Barua et al. | Nov 2015 | A1 |
20150348282 | Gibbon et al. | Dec 2015 | A1 |
20150371186 | Podgurny et al. | Dec 2015 | A1 |
20160041628 | Verma | Feb 2016 | A1 |
20160117657 | Forbes, Jr. et al. | Apr 2016 | A1 |
20160117756 | Carr et al. | Apr 2016 | A1 |
20160148289 | Altschuler | May 2016 | A1 |
20160162989 | Cole et al. | Jun 2016 | A1 |
20160171891 | Banatwala et al. | Jun 2016 | A1 |
20160203422 | Demarchi et al. | Jul 2016 | A1 |
20160224935 | Burnett | Aug 2016 | A1 |
20160225115 | Levy et al. | Aug 2016 | A1 |
20160253662 | Sriram | Sep 2016 | A1 |
20160307276 | Young | Sep 2016 | A1 |
20160297316 | Penilla et al. | Oct 2016 | A1 |
20160298977 | Newlin | Oct 2016 | A1 |
20160300296 | Alonso Cembrano | Oct 2016 | A1 |
20160307288 | Yehuda et al. | Oct 2016 | A1 |
20160307373 | Dean et al. | Oct 2016 | A1 |
20160321609 | Dube et al. | Nov 2016 | A1 |
20160349835 | Shapira | Dec 2016 | A1 |
20160364679 | Cao | Dec 2016 | A1 |
20170019496 | Orbach | Jan 2017 | A1 |
20170039770 | Lanier et al. | Feb 2017 | A1 |
20170046658 | Jones et al. | Feb 2017 | A1 |
20170046664 | Haldenby et al. | Feb 2017 | A1 |
20170046799 | Chan et al. | Feb 2017 | A1 |
20170046806 | Haldenby et al. | Feb 2017 | A1 |
20170048216 | Chow et al. | Feb 2017 | A1 |
20170053461 | Pal et al. | Feb 2017 | A1 |
20170061509 | Rosenberg et al. | Mar 2017 | A1 |
20170089710 | Slusar | Mar 2017 | A1 |
20170122746 | Howard et al. | May 2017 | A1 |
20170146360 | Averbuch | May 2017 | A1 |
20170232300 | Tran et al. | Aug 2017 | A1 |
20170243286 | Castinado et al. | Aug 2017 | A1 |
20170243310 | Dawkins | Aug 2017 | A1 |
20170249626 | Marlatt | Aug 2017 | A1 |
20170276500 | Margalit et al. | Sep 2017 | A1 |
20170293881 | Narkulla | Oct 2017 | A1 |
20170293950 | Rathod | Oct 2017 | A1 |
20170330274 | Conant, II et al. | Nov 2017 | A1 |
20170356749 | Shelby | Dec 2017 | A1 |
20170357914 | Tulabandhula | Dec 2017 | A1 |
20180012149 | Yust | Jan 2018 | A1 |
20180013211 | Ricci | Jan 2018 | A1 |
20180025417 | Brathwaite et al. | Jan 2018 | A1 |
20180046431 | Thagadur Shivappa et al. | Feb 2018 | A1 |
20180053226 | Hutton et al. | Feb 2018 | A1 |
20180053237 | Hayes et al. | Feb 2018 | A1 |
20180068355 | Garry | Mar 2018 | A1 |
20180075695 | Simpson | Mar 2018 | A1 |
20180095471 | Allan et al. | Apr 2018 | A1 |
20180102053 | Hillman et al. | Apr 2018 | A1 |
20180111494 | Penilla et al. | Apr 2018 | A1 |
20180117447 | Bao et al. | May 2018 | A1 |
20180121958 | Aist | May 2018 | A1 |
20180129276 | Nguyen et al. | May 2018 | A1 |
20180140903 | Poure | May 2018 | A1 |
20180143029 | Nikulin et al. | May 2018 | A1 |
20180157999 | Arora | Jun 2018 | A1 |
20180173742 | Liu et al. | Jun 2018 | A1 |
20180173800 | Chang et al. | Jun 2018 | A1 |
20180209803 | Rakah | Jul 2018 | A1 |
20180240542 | Grimmer | Aug 2018 | A1 |
20180278984 | Aimone et al. | Sep 2018 | A1 |
20180293638 | Simpson | Oct 2018 | A1 |
20180313798 | Chokshi et al. | Nov 2018 | A1 |
20180342106 | Rosado | Nov 2018 | A1 |
20180348863 | Aimone et al. | Dec 2018 | A1 |
20180357899 | Krivacic et al. | Dec 2018 | A1 |
20180365598 | Jamail | Dec 2018 | A1 |
20180365904 | Holmes | Dec 2018 | A1 |
20180374268 | Niles | Dec 2018 | A1 |
20190019144 | Gillen | Jan 2019 | A1 |
20190020973 | Harish | Jan 2019 | A1 |
20190047427 | Pogorelik | Feb 2019 | A1 |
20190050634 | Nerayoff et al. | Feb 2019 | A1 |
20190066528 | Hwang et al. | Feb 2019 | A1 |
20190102946 | Spivack et al. | Apr 2019 | A1 |
20190108686 | Spivack et al. | Apr 2019 | A1 |
20190139448 | Marshall et al. | May 2019 | A1 |
20190143828 | Sawada et al. | May 2019 | A1 |
20190146974 | Chung et al. | May 2019 | A1 |
20190158603 | Nelson et al. | May 2019 | A1 |
20190160958 | Chaudhary et al. | May 2019 | A1 |
20190178654 | Hare | Jun 2019 | A1 |
20190186942 | Rubin | Jun 2019 | A1 |
20190188450 | Spivack et al. | Jun 2019 | A1 |
20190204110 | Dubielzyk | Jul 2019 | A1 |
20190205798 | Rosas-Maxemin et al. | Jul 2019 | A1 |
20190228269 | Brent et al. | Jul 2019 | A1 |
20190236741 | Bowman et al. | Aug 2019 | A1 |
20190236742 | Tomskii et al. | Aug 2019 | A1 |
20190251503 | Simpson | Aug 2019 | A1 |
20190251509 | Simpson | Aug 2019 | A1 |
20190271553 | Simpson | Sep 2019 | A1 |
20190272589 | Simpson | Sep 2019 | A1 |
20190304000 | Simpson | Oct 2019 | A1 |
20190311431 | Simpson | Oct 2019 | A1 |
20190318286 | Simpson | Oct 2019 | A1 |
20190325541 | Simpson | Oct 2019 | A1 |
20190333166 | Simpson | Oct 2019 | A1 |
20190333181 | Simpson | Oct 2019 | A1 |
20190342106 | Li et al. | Nov 2019 | A1 |
20190353499 | Stenneth | Nov 2019 | A1 |
20200013498 | Gelber | Jan 2020 | A1 |
20200027096 | Cooner | Jan 2020 | A1 |
20200047055 | Ward | Feb 2020 | A1 |
20200098071 | Jackson | Mar 2020 | A1 |
20200125999 | Simpson | Apr 2020 | A1 |
20200151816 | Simpson | May 2020 | A1 |
20200156495 | Lindup | May 2020 | A1 |
20200160461 | Kaniki | May 2020 | A1 |
20200173808 | Beaurepaire et al. | Jun 2020 | A1 |
20200219017 | Simpson | Jul 2020 | A1 |
20200226853 | Ahmed et al. | Jul 2020 | A1 |
20200317074 | Miller et al. | Oct 2020 | A1 |
20200317075 | Yokoyama et al. | Oct 2020 | A1 |
20200389301 | Detres et al. | Dec 2020 | A1 |
20210012278 | Alon et al. | Jan 2021 | A1 |
20210041258 | Simpson | Feb 2021 | A1 |
20210042835 | Simpson | Feb 2021 | A1 |
20210158447 | Simpson | May 2021 | A1 |
20210166317 | Simpson | Jun 2021 | A1 |
20210248633 | Simpson | Aug 2021 | A1 |
20210318132 | Simpson | Oct 2021 | A1 |
20210326872 | Robotham | Oct 2021 | A1 |
20210379447 | Lee | Dec 2021 | A1 |
20220020073 | Farmer | Jan 2022 | A1 |
20220068081 | Pariseau | Mar 2022 | A1 |
20220100731 | Tirapu Azpiroz et al. | Mar 2022 | A1 |
20220122026 | Okabe et al. | Apr 2022 | A1 |
20230157579 | Sato | May 2023 | A1 |
20230377409 | Rye | Nov 2023 | A1 |
Number | Date | Country |
---|---|---|
107341968 | Nov 2017 | CN |
2539556 | Dec 2016 | GB |
2003177034 | Dec 2001 | JP |
2001041084 | Jun 2001 | WO |
WO-0141084 | Jun 2001 | WO |
2015059691 | Apr 2015 | WO |
2015161307 | Apr 2015 | WO |
WO-2018024844 | Feb 2018 | WO |
2019134005 | Jul 2019 | WO |
2019183468 | Sep 2019 | WO |
2021163675 | Aug 2021 | WO |
Entry |
---|
Zheyong Bian, Planning the Ridesharing Route for the First-Mile Service Linking to Railway Passenger Transportation, Apr. 2017, Joint Rail Conference (Year: 2017). |
PCT International Search Report and Written Opinion; PCT/US2020/027543; dated Jul. 1, 2020. |
PCT International Search Report and Written Opinion; PCT/US2020/023223; dated Jun. 19, 2020. |
PCT International Search Report and Written Opinion; PCT/US2020/023729; dated Jun. 18, 2020. |
PCT International Search Report and Written Opinion; PCT/US2020/021546; dated Jun. 8, 2020. |
PCT International Search Report and Written Opinion; PCT/US2020/018012; dated Apr. 21, 2020. |
PCT International Search Report and Written Opinion; PCT/US2020/012208; dated Mar. 24, 2020. |
Westerman; Longitudinal Analysis of Biomarker Data from a Personalized Nutrition Platform in Healthy Subjects; Nature, Scientific Reports; vol. 8; Oct. 2, 2018 (retrieved Jun. 10, 2020). https://www.nature.com/articles/s41598-018-33008-7. |
Ahmed, et al.; Energy Trading with Electric Vehicles in Smart Campus Parking Lots; Applied Sciences; Sep. 7, 2018. |
Fitzsimmons; Uber Hit with Cap as New York City Takes Lead in Crackdown; New York Times; Aug. 8, 2018 (retrieved Feb. 29, 2020). https://www.wral.com/uber-hit-with-cap-as-new-york-city-takes-lead-in-crackdow/17755819/?version=amp?. |
Soccer ball-shaped drone might be the safest flying robot yet https://mashable.com/2015/12/21/soccer-ball-drone/ ; Dec. 21, 2015. |
Fleishman; Use Parking Apps to Find Lots, Garages, Valet, and Meters; Macworld; Jul. 19, 2015. |
Borras, et al. Intelligent Tourism Reminder Systems: A Survey; Expert Systems with Applications 41; Elsevier; Jun. 9, 2014. |
Pentland; After Decades of Doubt, Deregulation Delivers Lower Electricity Rates; Forbes; Oct. 13, 2013 (retrieved Feb. 29, 2020). https://www.forbes.com/sites/williampentland/2013/10/13/after-decades-of-doubt-deregulation-delivers-lower-electricity-prices/#201d4a9c1d13. |
Sun, et al.; Real-Time MUAV Video Augmentation with Geo-Information for Remote Monitoring; 2013 Fifth International Conference on Geo-Information Technologies for Natural Disaster Management; pp. 114-118; IEEE; 2013. |
U.S. Appl. No. 60/035,205, filed Jan. 10, 1997. |
The Wayback Machine, Interest Rate Swaps, https://web.archive.org/web/20171006212154/https://global.pimco.com/en/gbl/resources/education/understanding-interest-rate-swaps, 2016, pp. 1-7. |
Freight Derivatives—a Vital Tool for Your Business, https://www.reedsmith.com/-/media/files/perspectives/2007/02/ freight-derivatives--a-vital-tool-for-your-business/files/freight-derivatives--a vital-tool-for-your-business/fileattachment/etcfreightderivativesavitaltoolforyourbusiness.pdf (Year: 2007), Energy, Trade & Commodities, pp. 1-3. |
Barry, Kieth, App lets drivers auction public parking spaces, Wired, Aug. 11, 2011, pp. 1-4. |
Jiang, Landu, et al., Sun Chase: Energy-Efficient Route Planning for solar-powered Evs, IEEE 37th international conference on distrubuted computing systems, 2017, pp. 1-11. |
Netlingo, https://web.archive.org/web/20170122184857/https://www.netlingo.com/word/electronic-exchange.php,dated Oct. 22, 2017. |
Laseter, Tim, “B2B benchmark: The State of Electronic Exchanges”, Tech & Innovation, dated Oct. 1, 2001. |
Directed Graph, https://en.wikipedia.org/wiki/Directed_graph, pp. 1-6, 2022. |
About IBM Food Trust, https://www.ibm.com/downloads/cas/E9DBNDJG, pp. 1-17, 2019. |
IBM Blockchain Transparent Supply, https://www.ibm.com/downloads/cas/BKQDK0M2, pp. 1-14, Aug. 2020. |
Radocchia, Samantha, 3 Innovative Ways Blockchain Will Build Trust in the Food Industry, https://www.forbes.com/sites/samantharadocchia/2018/04/26/3-innovative-ways-blockchain-will-build-trust-in-the-food-industry/?sh=65bc79f42afc, Forbes, pp. 1-5, Apr. 26, 2018. |
Change the World, https://fortune.com/change-the-world/2019/ibm/, Fortune Media IP Limited, pp. 1-5, 2022. |
IBM Food Trust, https://www.constellationr.com/node/17601/vote/application/view/588, Constellation Research Inc., pp. 1-4, 2010-2022. |
Dey, Somdip, et al., FoodSQRBlock: Digitizing Food Production and the Supply Chain with Blockchain and QR Code in the Cloud, https://www.mdpi.com/2071-1050/13/6/3486/htm, MDPI, pp. 1-27, Mar. 22, 2021. |
Wyzant, https://web.archive.org/web/20190327185429/https://www.wyzant.com/hotitworks/students, Wyzant tutoring, pp. 1-13 , Mar. 27, 2019. |
PCT International Search Report and Written Opinion; PCT/US2021/065855; dated Mar. 29, 2022. |
PCT International Search Report and Written Opinion; PCT/US2022/012717; dated Mar. 30, 2022. |
Peters, et al.; Student Support Services for Online Learning Re-Imagined and Re-Invigorated: Then, Now and What's to Come; Contact North | Contact Nord; Sep. 2017. |
PCT International Search Report and Written Opinion; PCT/US2022/027077; dated Nov. 1, 2022. |
Little, T.D., et al., On the Joys of Missing Data, Journal of pediatric psychology, 2014, pp. 151-162. |
Honaker, J., et al., What to do About Missing Values in Time-Series Cross-Section Data, American Journal of Political Science, Sep. 6, 2008, pp. 561-581. |
Westerhoff, Market Depth and Price Dynamics: A Note, University of Osnabrueck, Department of Economics Rolandstrasse 8, D-49069 Osnabrueck, German, Mar. 30, 2004, pp. 1-8. |
PCT International Search Report and Written Opinion; PCTUS2022/051998; dated Mar. 8, 2023. |
EP23153137.7 European Search Report, dated May 24, 2023, pp. 1-10. |
EP20787830.7 European Search Report, dated May 12, 2023, pp. 1-10. |
Zheyong, Bian, et al., “Planning the Ridesharing Route for the First-Mile Service Linking to Railway Passenger Transportation,” Joint Rail Conference, Apr. 2017, pp. 1-11. |
EP23168879.7 European Search Report, dated Jul. 5, 2023, pp. 1-13. |
Ramasubramanian, Vasant, “Quadrasense: Immersive UAV-based cross-reality environmental sensor networks,” phD diss., Massachusetts Institute of Technology, pp. 1-75, 2015. |
Zhao, et al., Incentives in Ridesharing with Deficit Control, Proceedings of the 13th International Conference on Autonomous Agents and Multiagent Systems (AAMAS 2014), May 5-9, 2014, pp. 1021-1028. |
Li, Jundong, et al., “Multi-network Embedding”, pp. 1-9, 2018. |
Papa, U., & Del Core, G., “Design of Sonar Sensor Model for Safe Landing of an UAV,” IEEE Metrology for Aerospace, 2015, pp. 346-350. |
Wei, et al. “impact of aircraft size and seat availability on airlines demand and market share in duopoly markets” Published by Elsevier, 2005, pp. 315-327. |
PCT International Search Report and Written Opinion; PCT/US2022/052969; Mar. 21, 2023. |
Speediance, All-in-One Smart Home Gym; retrieved from internet: https://www.amazon.com/Speediance-Equipment-Resistance-Training-Machine-Works/dp/B0C4KF7844/?th=1; May 8, 2023; p. 1. |
Freebeat, Smart Exercise Bike; retrieved from internet: https://www.amazon.com/Resistance-Cushioned-Detection-Altorithm-Instructors/dp/BOBZKKZ6B3/?th=1; Mar. 3, 2023; p. 1. |
Aratani, Lori, “This app wants to reward you for smart commuting choices,” The Washington Post, Aug. 18, 2018, pp. 1-3. |
Yu, Haicong et al.; “A Multi-Modal Route Planning Approach with an Improved Genetic Algorithm”, The International Archives of the Photogrammetry, Remote Sensing and Spaital Information Sciences, vol. 38, Part I, 2010. |
“Node Influence Metric”, Wikipedia, Nov. 6, 2020, pp. 1-5. |
EP21916571 European Search Report, Jun. 18, 2024, pp. 1-9. |
Number | Date | Country | |
---|---|---|---|
20190228351 A1 | Jul 2019 | US |