Questions about how individual parts of claim 1 might be changed. A question may describe something different from what the claim language recites, or a version of it; no view is offered on which.
1.1Hardwired relay sequencer
What ifWhat if a hardwired relay sequencer controls a mobile charging cabinet without a processor?
Claim language“a processor”
A rotary selector assigns the next cabinet output, and relay interlocks check connector engagement and emergency stop continuity before closing the selected contactor. An analog current regulator holds the configured output limit, and an electromechanical timer opens the contactor at the end of the charging interval.
1.2Schedule charging from telemetry
What ifWhat if the scheduler creates charging jobs from routine battery telemetry without receiving charging requests?
Claim language“receive a plurality of charging requests”
A fleet gateway publishes each vehicle's state of charge and parked location at 60-second intervals. The scheduler compares those readings with stored departure times and minimum departure charge levels, then creates jobs for parked vehicles below their targets.
1.3Cyclic group selection
What ifWhat if a rotating pointer selects the next group without calculating a score for any group?
Claim language“a score for the coalition”
The dispatcher maintains a fixed circular list of registered vehicle groups and a pending request flag for each group. At each scheduling opportunity it scans forward from the pointer, serves the first pending group for a fixed interval, and advances the pointer to the following group.
1.4Credential and reservation checks
What ifWhat if charging permission depends on a signed reservation and a matching group credential?
Claim language“based on a corresponding score”
The station verifies the reservation signature with a stored public key and checks that the reservation names the presenting group and the current station. It grants access when the current time falls within the reservation interval and the reservation identifier is unused.
1.5Allocate capacity before authorization
What ifWhat if the dispatcher assigns chargers and power budgets before the station checks charging permission?
Claim language“allocate charging resources based on determining”
At the start of each 15-minute scheduling period, the dispatcher assigns a mobile charger and reserves its available power against a fleet booking. At connection time the station verifies the presented credential before energizing the assigned output, and an unused reservation expires at the end of the period.
Section 2 · machine-generated
Variations
Further arrangements of the same subject matter, described here as of the publication date at the foot of this page.
Other field of use
Mobile charging for warehouse truck groups
A warehouse dispatch server receives group requests for electric lift trucks, with a parking bay, energy target, and next-shift start time for each truck. The server scores each group using its lowest reported battery charge level and the time remaining before its earliest shift, then admits groups that reach a configured threshold. For each admitted group, the server reserves a mobile charging cart and sends it a bay sequence, truck identifiers, and per-truck energy targets. The cart verifies each truck identifier before energizing its connector and reports delivered energy so the server updates the group's remaining demand and score.
Component substitution
Relay sequencing with fixed logic
A fixed-function logic circuit replaces the stored-program processor and instruction memory with request registers, adders, comparators, and a finite-state machine. A wired receiver writes each coalition's requested energy and deadline into its register bank, and the circuit computes a score by adding deadline urgency and waiting-time points. A priority encoder selects the highest scoring request above the admission threshold, and the state machine reserves an available outlet and drives its contactor through a safety interlock. When the energy meter reaches the reserved quantity, the state machine opens the contactor, clears the served request, and recomputes the coalition score from any requests still pending.
Parameter or scale variation
Quarter-hour reservations for mobile chargers
A depot scheduler manages four mobile chargers, each rated at 30 kW, under a shared 90 kW site limit. Every five minutes it scores pending coalition requests using minutes waited and minutes remaining before departure, then admits requests above a configured threshold. It reserves charger time in 15-minute blocks, limits each block to 7.5 kWh at the charger output, and dispatches at most three chargers at rated power at once. At the end of each block, the scheduler subtracts metered energy from the coalition's open request, updates its waiting time, and recalculates its score.
Combination with existing systems
Charging schedules tied to fleet dispatch
A charging controller imports vehicle assignments, route energy estimates, and departure times from a fleet dispatch system and associates those records with incoming coalition requests. It scores each coalition using the energy deficit of its assigned vehicles and the time remaining before their next departures. For an admitted coalition, the controller reserves a mobile charger and parking bay, publishes the reservation to the dispatch system, and enables power after the assigned vehicle connects. As the charger reports delivered energy, the controller updates the vehicle's dispatch readiness and recalculates the coalition score from the remaining route deficits.
Charging allocation with a building battery
A mobile charger scheduler exchanges building load, battery state of charge, and feeder power limits with a building energy management controller. It scores incoming coalition requests by their remaining energy and departure times, then admits requests that pass the score threshold and fit within the energy budget reported for the requested interval. The scheduler reserves mobile charger capacity and sends the energy management controller a charging power profile, which the controller uses to dispatch the building battery during intervals of high feeder load. The scheduler enables the allocated chargers at their assigned power limits and updates coalition scores using metered delivery and remaining demand.
Automated or data-driven variant
Sensor-driven allocation at cooled charging bays
Temperature sensors at the connectors and current sensors at the charger outputs feed a controller that receives energy targets and departure deadlines from vehicle coalitions. The controller estimates available charging power for each connector using its measured temperature and a configured thermal derating curve. It scores each coalition by the predicted energy delivered before departure, admits requests above a configured threshold, and assigns connectors and current limits to admitted groups. During charging, the controller updates the current limits as temperatures change and refreshes each score using metered energy and the revised delivery estimate.
Specific version of a part
Requests from group gateways
A solid-state drive stores instructions for a dispatcher that receives messages over an encrypted network connection from gateways representing separate vehicle groups. Each message carries a group identifier, requested energy in kilowatt-hours, a charging location, and the latest acceptable completion time.
Score by departure urgency
For each group, the processor subtracts estimated charging time from the minutes remaining until the group's earliest vehicle departure. It clamps the resulting slack to a range of zero to 120 minutes and subtracts that value from 120 to produce the group's score.
Interlocked direct current delivery
The controller verifies connector engagement and insulation resistance, then precharges the direct-current output to bring it within 10 volts of the vehicle battery voltage before closing the main contactors. It commands a current no greater than the vehicle's reported limit or the power module's available current, whichever is lower.
Update scores from metered energy
At session close, the processor reads the delivered energy from the station meter and reduces the group's stored score by one point per whole kilowatt-hour, with a floor of zero. It commits the score change and the processed session identifier in one database transaction so a repeated closing message produces a single adjustment.
Section 3 · quoted from USPTO records
Other work
Passages reproduced word for word from two earlier-published U.S. patent documents, placed beside the language of claim 1. No characterization is offered. Each passage is marked A or B for the document it comes from; ¶ numbers are the paragraph numbers in the USPTO’s published full text of that document.
As shown in FIG. 6, the computer system 800, which is a form of a data processing system, includes a bus 803 which is coupled to one or more microprocessor(s) 805 and a ROM (Read Only Memory) 807 and volatile RAM 809 and a non-volatile memory 811.
B · US 9,465,734 B1 · ¶ 36
1.2a non-transitory computer-readable medium comprising instructions executable by the processor to configure the system to: receive a plurality of charging requests from a plurality of electric vehicle coalitions;
Rather, instead of a single coalition for all the buyers who submitted service requests, the buyers might be grouped into a set of possible coalitions.
A · US 2009/0327147 A1 · ¶ 77
1.3a non-transitory computer-readable medium comprising instructions executable by the processor to configure the system to: determine, for each coalition of the plurality of electric vehicle coalitions, a score for the coalition;
In one embodiment, a system can determine the total memory usage footprint of each coalition and use these determined footprints to select one (or more) coalitions for memory usage reduction operations (such as terminating one or more helper processes in a selected coalition).
B · US 9,465,734 B1 · ¶ 4
1.4a non-transitory computer-readable medium comprising instructions executable by the processor to configure the system to: determine, for a first coalition of the plurality of electric vehicle coalitions and based on a corresponding score, that a charging permission for the first coalition is acceptable;
1.5a non-transitory computer-readable medium comprising instructions executable by the processor to configure the system to: allocate charging resources based on determining that the charging permission for the first coalition is acceptable;
1.6a non-transitory computer-readable medium comprising instructions executable by the processor to configure the system to: enable a charging service to the first coalition by controlling the charging resources; and
1.7a non-transitory computer-readable medium comprising instructions executable by the processor to configure the system to: adjust the corresponding score.
An empty cell means only that no passage was reproduced there.
Statements in these documents
Yet, the tools available for market players (e.g., buyers and sellers) are limited to exploit the market opportunities.
A · US 2009/0327147 A1 · ¶ 4
More specifically, a feedback mechanism permits initially-proposed constraints to be selectively relaxed to formulate a coalition that is more optimal in at least one aspect.
A · US 2009/0327147 A1 · ¶ 2
These multiple applications or processes in the same device compete with each other by sharing the same memory resources and computation resources embedded within a device, and the operating system performs resource management, such as memory management, to deal with resource contention in concurrent computing.
B · US 9,465,734 B1 · ¶ 3
In one or more embodiments described herein, a coalition of a host process, such as a first host application, and any helper processes is used to determine a memory usage amount (e.g. total memory footprint) of the processes in the coalition in order to determine whether or how to perform memory management operations on the coalition or other coalitions of processes.
B · US 9,465,734 B1 · ¶ 4
Cite aspatent.fyi, US 2026/0356235 A1, claim 1, first published 2026-11-19T22:39:24-05:00, https://patent.fyi/US20260356235/, SHA-256 dfcb4c0cd8687588c42290eba93021a1367afe3120f664defb65a0f5e634e512