John Humble

Greg Droge

Skylar Cox

Justin Whitaker

For determining a communication window is disclosed, a method generates a communication graph that includes backbone nodes, dummy nodes, data collection nodes, downlink nodes, crosslink send nodes, and crosslink receive nodes. The backbone nodes, the data collection nodes, the downlink nodes, the crosslink-transmit nodes, and the crosslink-receive nodes are connected by one of a homogenous edge between nodes of a same type and transition edges between nodes of a different type. The method determines access windows for downlink communications and crosslink communications using the communication graph. The method selects access windows based on a task graph generated from the communication graph. The method communicates from a given satellite within the selected access windows.

Determining communication windows

For generating a points-of-interest plan, a method generates communication graph nodes for at least one satellite. The method calculates communication graph edges from the communication graph nodes, wherein the communication graph nodes and the communication graph edges comprise a communication graph. The method solves the communication graph to yield a communication plan. The method generates a points-of-interest plan from the communication plan.

Growing community of inventors

Logan, UT, United States of America

John Humble