US 11,657,364 B1
Logistical management system
Sergio Capozzi, Solana Beach, CA (US); Brandy Reed Giestas, Watertown, MA (US); Derek Cannon, Oceanside, CA (US); Gregory Lawrence, Solana Beach, CA (US); Ryan Rusnak, Vista, CA (US); Melinda Wu, Oceanside, CA (US); Chad Molenda, Carlsbad, CA (US); and Jacob Kania, Solana Beach, CA (US)
Assigned to Airspace Technologies, Inc., Carlsbad, CA (US)
Filed by Airspace Technologies, Inc., Carlsbad, CA (US)
Filed on Nov. 23, 2021, as Appl. No. 17/534,070.
Int. Cl. G06Q 10/08 (2012.01); G06N 20/00 (2019.01); G06Q 10/0835 (2023.01); G06Q 10/0832 (2023.01); G06Q 10/0833 (2023.01)
CPC G06Q 10/08355 (2013.01) [G06N 20/00 (2019.01); G06Q 10/0832 (2013.01); G06Q 10/0833 (2013.01)] 13 Claims
OG exemplary drawing
 
1. A system comprising:
a user interface comprising a display;
a non-transitory computer-readable medium comprising instructions; and
a processor in communication with the non-transitory computer-readable medium and with the display, wherein the instructions, when executed by the processor, are configured to cause the processor to:
process, by the processor, a user request for transporting a good from a pickup location to a destination location, the process comprising:
identifying, by the processor and within a pre-generated graph data structure, a pickup node representing the pickup location and a destination node representing the destination location;
identifying, by the processor and within the pre-generated graph data structure, a first intermediate node representing a first intermediate location, and a second intermediate node representing a second intermediate location by traversing the pre-generated graph data structure based on the pickup node and the destination node;
determining, by the processor, a plurality of transportation edges that each relate to a transit cost associated with a corresponding one of the pickup location, the first intermediate location, the second intermediate location, and the destination location, wherein each of the plurality of transportation edges correspond to one of the pickup node, the first intermediate node, the second intermediate node, and the destination node such that each of the pickup node, the first intermediate node, the second intermediate node, and the destination node corresponds to the transit cost;
determining, by the processor, a tendering edge corresponding to the first intermediate node, the tendering edge relating to an actual tender time to move the good from a first vehicle that has arrived at the first intermediate location to a tender location of the first intermediate location;
determining, by the processor and using a cargo database, a cargo edge corresponding to the first intermediate node, the cargo edge relating to a time for loading the good onto a second vehicle upon receipt of the good at the first intermediate location;
generating, by the processor, a subgraph of the pre-generated graph data structure comprising the pickup node, the first intermediate node, the second intermediate node, the destination node, the tendering edge, the cargo edge, and the plurality of transportation edges; and
generating a preferred route from the pickup location to the destination location based on the subgraph; and
controlling, by the processor, the transporting of the good from the pickup location to the destination location along the preferred route, the controlling comprising:
modifying, by the processor, the display to include an automatically generated task icon associated with a task for managing the user request, the task icon comprising:
a description of the task;
a counter that displays a count to or from a date that the task is scheduled to be completed;
a button that when activated performs an action related to the task; and
automatically setting, by the processor, aspects of the task icon in response to triggers.